//#pragma GCC optimize(3,"Ofast","inline")
//#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
//#define int long long
//#define endl '\n'
#define db double
#define fi first
#define se second
#define ls u<<1
#define rs u<<1|1
#define pb push_back
#define lbt(x) (x&(-x))
#define mii map<int,int>
#define pii pair<int,int>
#define ull unsigned long long
#define all(x) x.begin(),x.end()
#define go(i,a,b) for(int i=a;i<=b;i++)
#define godown(i,a,b) for(int i=a;i>=b;i--)
#define WJXNB ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(0)
using namespace std;
//mt19937_64 rnd(time(0));
const int maxn=200010;
const int mod=998244353;
const int inf=0x3f3f3f3f;
const ll linf=0x3f3f3f3f3f3f3f3f;
const double eps=1e-12;

inline char nc() {
    static char buf[1000000], *p1 = buf, *p2 = buf;
    return p1 == p2 && (p2 = (p1 = buf) + fread (buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++;
}
inline void read(int &sum) {
    char ch = nc();
    int tf = 0;
    sum = 0;
    while((ch < '0' || ch > '9') && (ch != '-')) ch = nc();
    tf = ((ch == '-') && (ch = nc()));
    while(ch >= '0' && ch <= '9') sum = (sum<<3)+(sum<<1)+ (ch - 48), ch = nc();
    (tf) && (sum =- sum);
}
inline void write(int x){
    if (x < 0) x = ~x + 1, putchar('-');
    if (x > 9) write(x / 10);
    putchar(x % 10 + '0');
}

ll qpow(ll x,ll y,ll mod){
    ll re=1ll;
    while(y){
        if(y&1)(re*=x)%=mod;
        (x*=x)%=mod,y>>=1;
    }
    return re;
}

void solve(){
    
    string s;
    cin>>s;
    int n=s.length();
    vector<int>ans;
    for(int i=n-1;i>=0;i--){
        if(s[i]=='V'){
            if(i&&s[i-1]=='I')ans.push_back(4),i--;
            else ans.push_back(5);
        }
        else{
            if(i&&s[i-1]=='I'){
                if(i-1&&s[i-2]=='I'){
                    if(i-2&&s[i-3]=='V')ans.push_back(8),i-=3;
                    else ans.push_back(3),i-=2;
                }
                else if(i-1&&s[i-2]=='V')ans.push_back(7),i-=2;
                else ans.push_back(2),i-=1;
            }
            else if(i&&s[i-1]=='V')ans.push_back(6),i-=1;
            else ans.push_back(1),i--;
        }
        
    }
    for(int i=(int)ans.size()-1;i>=0;i--)cout<<ans[i];
        cout<<endl;
    return;
}

signed main(){
    WJXNB;
    int t=1;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}