#include <bits/stdc++.h>
using namespace std;
map <int, string> z;
void init(){
z[1]=	"I";
z[2]=	"II";
z[3] =	"III";
z[4] =	"IV";
z[5] =	"V";
z[6] =	"VI";
z[7] =	"VII";
z[8] =	"VIII";
z[9] =	"IX";
z[10] =	"X";
z[11] =	"XI";
z[20] =	"XX";
z[30] =	"XXX";
z[40] =	"XL";
z[50] =	"L";
z[60] =	"LX";
z[70] =	"LXX";
z[80] =	"LXXX";
z[90] =	"XC";
z[100] =	"C";
z[200] =	"CC";
z[300] =	"CCC";
z[400]=	"CD";
z[500] =	"D";
z[600] =	"DC";
z[700]=	"DCC";
z[800] =	"DCCC";
z[900] =	"CM";
z[1000] =	"M";
z[2000]=	"MM";
z[3000]=	"MMM";
z[3999]=	"MMMCMXCIX";
}

void solve(int n)
{
    init();
    auto mp = z.end();
    --mp;
    while (true){
        auto &now = *mp;
        while (n >= now.first){
            cout << now.second;
            n -= now.first;
        }
        if (mp == z.begin()) break;
        --mp;
    }
}