#include #define rep(i, a, n) for(int i = a; i < n; i++) using namespace std; typedef pair P; const int INF = 1e8; int d[8] = {1, 5, 10, 50, 100, 500, 1000, 5000}; string str = "IVXLCDM"; int change_10(string s){ int res = 0; int now, pre = INF; rep(i, 0, s.size()){ int id = str.find(s[i]); now = d[id]; if(pre < now){ res += now - pre; pre = INF; }else{ if(pre != INF) res += pre; pre = now; } } if(pre != INF) res += pre; return res; } string change_roman(int n){ string res = ""; for(int i = 0; i < str.size(); i++){ int tmp = (n % d[i + 1]) / d[i]; // cout << n << ' ' << d[i + 1] << ' ' << d[i] << ' ' << tmp << endl; if(tmp == 4){ if((n % d[i + 2]) / d[i] == 9){ res += str[i + 2]; res += str[i]; n -= 9 * d[i]; }else{ res += str[i + 1]; res += str[i]; n -= tmp * d[i]; } }else{ for(int j = 0; j < tmp; j++) res += str[i]; n -= tmp * d[i]; } } reverse(res.begin(), res.end()); return res; } int main(){ int n; cin >> n; int sum = 0; for(int i = 0; i < n; i++){ string s; cin >> s; int tmp = change_10(s); sum += tmp; } if(sum >= 4000){ cout << "ERROR" << endl; return 0; } string ans = change_roman(sum); cout << ans << endl; }