#include<bits/stdc++.h>

using namespace std;
using ll = long long;

vector<string>all;

map<ll, string>f;
map<char, ll>sz;

string get(ll x) {
    string ans = "";
    if(x>=100) ans += f[(x/100)*100];
    x %= 100;
    if(x>=10)  ans += f[(x/10)*10];
    x %= 10;
    if(x) ans += f[x]; 
    return ans;
}

void init() {
    f[1] = "I";
    f[2] = "II";
    f[3] = "III";
    f[4] = "IV";
    f[5] = "V";
    f[6] = "VI";
    f[7] = "VII";
    f[8] = "VIII";
    f[9] = "IX";
    
    f[10] = "X";
    f[20] = "XX";
    f[30] = "XXX";
    f[40] = "XL";
    f[50] = "L";
    f[60] = "LX";
    f[70] = "LXX";
    f[80] = "LXXX";
    f[90] = "XC";
    
    f[100] = "C";
    f[200] = "CC";
    f[300] = "CCC";
    f[400] = "CD";
    f[500] = "D";
    f[600] = "DC";
    f[700] = "DCC";
    f[800] = "DCCC";
    f[900] = "CM";

    for(ll i = 1 ; i <= 999 ;i ++) {
        all.push_back(get(i));
        //cout << i << ' ' << get(i) << endl;
    }
    sort(begin(all), end(all));
    for(auto &s: all) {
        sz[s[0]]++;
    }
}


void solve() {
    ll n; cin >> n;
    while(n--) {
        ll x; cin >> x;
        ll cnt = x/1000;
        x %= 1000;
        
        if(x==0) {
            cout << cnt * (sz['C'] + sz['D'] + sz['I'] + sz['L'] + 1) << '\n'; 
            continue;
        }

        ll now = 0;
        string temp = get(x);
        if(temp[0]=='C' or temp[0]=='D') {
            now = cnt*(sz['C'] + sz['D'] + sz['I'] + sz['L'] + 1);
            now += lower_bound(begin(all), end(all), temp) - begin(all) + 1;
        }
        else {
            now = -cnt*(sz['V'] + sz['X']);
            now -= end(all) - lower_bound(begin(all), end(all), temp);
        }
        cout << now << '\n';
    }
}

int main() {
    init();
    solve();
}