#include using namespace std; typedef signed long long ll; #undef _P #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) //------------------------------------------------------- int N; int hoge(string s) { int ret=0,i; FOR(i,s.size()) { if(i3999) return "ERROR"; while(T>=1000) { s+="M"; T-=1000; } if(T>=900) { s+="CM"; T-=900; } if(T>=500) { s+="D"; T-=500; } if(T>=400) { s+="CD"; T-=400; } while(T>=100) { s+="C"; T-=100; } if(T>=90) { s+="XC"; T-=90; } if(T>=50) { s+="L"; T-=50; } if(T>=40) { s+="XL"; T-=40; } while(T>=10) { s+="X"; T-=10; } if(T>=9) { s+="IX"; T-=9; } if(T>=5) { s+="V"; T-=5; } if(T>=4) { s+="IV"; T-=4; } while(T>=1) { s+="I"; T-=1; } return s; } void solve() { int i,j,k,l,r,x,y; string s; cin>>N; int tot=0; FOR(i,N) { cin>>s; tot+=hoge(s); } cout<