#include <vector>
#include <string>
#include <iostream>

using namespace std;

vector<bool> IS_V_FOR;
string       STR;
int          ROMAN_SAVE[81];

int gid(string s) {
    int ans = 0;
    for (int i = 0; i < s.size(); ++ i) {
        ans = ans * 3;
        if (s[i] == 'V') {
            ans += 2;
        }
        else {
            ans += 1;
        }
    }
    return ans;
}

int gid(int start, int len) {
    int ans = 0;
    for (int i = start; i < start + len; ++ i) {
        ans = ans * 3;
        if (IS_V_FOR[i]) {
            ans += 2;
        }
        else {
            ans += 1;
        }
    }
    return ans;
}

int gval(int start, int len) {
    return ROMAN_SAVE[gid(start, len)];
}

void initial() {
    cin >> STR;
    IS_V_FOR.resize(STR.size());
    for (int i = 0; i < STR.size(); ++ i) {
        IS_V_FOR[i] = STR[i] == 'V';
    }

    for (int i = 0; i < 16; ++ i) {
        ROMAN_SAVE[i] = 0;
    }
    ROMAN_SAVE[gid("I")] = 1;
    ROMAN_SAVE[gid("II")] = 2;
    ROMAN_SAVE[gid("III")] = 3;
    ROMAN_SAVE[gid("IV")] = 4;
    ROMAN_SAVE[gid("V")] = 5;
    ROMAN_SAVE[gid("VI")] = 6;
    ROMAN_SAVE[gid("VII")] = 7;
    ROMAN_SAVE[gid("VIII")] = 8;
}

//
// CORE
//  ====
const int maxn = 1e5 + 10;
int dp_from[maxn];
int dp_len[maxn];
int dp_val[maxn];

void solve() {
    for (int i = STR.size(); i >= 0; -- i) {
        dp_from[i] = -1;
        dp_val[i] = 1e8;
        dp_len[i] = 1e8;
    }
    dp_val[STR.size()] = 0;
    dp_from[STR.size()] = -1;
    dp_len[STR.size()] = 0;
    for (int i = STR.size(); i >= 0; -- i) {
        if (i != STR.size() ) {
            // RUN.
            // ANYWAY.
        }
        // TRANS
        for (int j = i - 1; j >= i - 4 && j >= 0; -- j) {
            int thegid = gval(j, i - j);
            if (thegid == 0) {
                continue;
            }
            if (dp_len[j] > dp_len[i] + 1) {
                dp_from[j] = i;
                dp_val[j] = thegid;
                dp_len[j] = dp_len[i] + 1;
            }
            else if (dp_len[j] == dp_len[i] + 1 && thegid < dp_val[j]) {
                dp_from[j] = i;
                dp_val[j] = thegid;
                dp_len[j] = dp_len[i] + 1;
            }
        }
    }
    int i = 0;
    while (i < STR.size() && i >= 0) {
        cout << gval(i, dp_from[i] - i);
        // cout << gval(i, dp_from[i] - i) << " " << i << " " << STR.size() << endl;
        i = dp_from[i];
    }
    cout << endl;
}// SOLVE.
// OTHERS IS LEFT OVER.


int main() {
    int n;
    cin >> n;
    while (n--) {
        initial();
        solve();
    }
}