1 #include<bits/stdc++.h>

 #define pb push_back

 using namespace std;

 const int maxn = 1e3 + ;

 struct node {//结构体保存数据

     string v;

     string t;

     int id;

     node() {

         id = ;

     }

     node(string x, string y, int d) : v(x),t(y),id(d){}

     bool operator<(const node&x)const {//排序方法

         if(v == x.v) return id < x.id;

         return v < x.v;

     }

 };

 int romanToInt(string s) {//计数阿拉伯数字对应的数值

         int tagVal[];

         tagVal['I'] = ;

         tagVal['V'] = ;

         tagVal['X'] = ;

         tagVal['C'] = ;

         tagVal['M'] = ;

         tagVal['L'] = ;

         tagVal['D'] = ;

         int val = ;

         for(int i = ; i < s.length(); i++){

             if(i+ >= s.length() || tagVal[s[i+]] <= tagVal[s[i]])

                 val += tagVal[s[i]];

             else

                 val -= tagVal[s[i]];

         }

         return val;

     }

 int main() {

     int n;

     vector<node> a;

     string x, y;

     cin >> n;

     for (int i = ; i < n; i++) {

         cin >> x >> y;

         node t(x, x+" " + y, romanToInt(y));

         a.pb(t);

     }

     sort(a.begin(), a.end());

     for (node&t:a)

         cout << t.t << endl;

     return ;

 }