#pragma GCC optimize("Ofast,O3,unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define ps push
#define in insert
#define f first
#define s second
#define nl cout<<"\n"
#define ca(v) for(auto i:v) cout<<i<<" ";
#define cbit(x) __builtin_popcount(x)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a*b/gcd(a, b))
const int xm[4] = {-1, 1, 0, 0};
const int ym[4] = {0, 0, -1, 1};
const int MOD = 1e9 + 7;
const int MAXN = 5e5 + 5;
const ll POW = 9973;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    if (fopen("input.in", "r")) {
        freopen("input.in", "r", stdin);
        freopen("output.out", "w", stdout);
    }
    int t; cin>>t;
    while(t--){
        string s; cin>>s;
        int last = s[s.size()-1];
        int n =s.size();
        int cur = (last == 'V') ? 5 : 1;
        vector<int> res;
        for(int i=n-2; i>=0; i--){
            if(s[i] == 'V') {
                if(cur > 3) {
                    res.pb(cur);
                    cur = 5;
                } else if(cur) {
                    cur += 5;
                    res.pb(cur);
                    cur = 0;
                } else {
                    cur = 5;
                }

            }
            if(s[i] == 'I') {
                if(cur == 5) {
                    cur -= 1;
                    res.pb(cur);
                    cur = 0;
                } else if(cur == 3){
                    res.pb(cur);
                    cur = 1;
                } else if(cur < 3) {
                    cur++;
                }
            }
        }
        if(cur) res.pb(cur);
        reverse(all(res));
        for(int i:res) cout<<i;
        nl;
    }

}