#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define Enter putchar('\n')
#define spc putchar(' ')
#define pb push_back
#define fi first
#define se second
inline void read(int &num){num=0;int f=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){num=(num<<1)+(num<<3)+(ch^48);ch=getchar();}num*=f;}
inline void lread(long long &num){num=0;int f=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){num=(num<<1)+(num<<3)+(ch^48);ch=getchar();}num*=f;}
void print(long long num){if(num<0){putchar('-');num=-num;}if(num>9){print(num/10);}putchar((num%10)^48);}
int a[5]={1,2,5,6,7};
char s[100009];
int dp[100009][10];
int f[100009],ans[100009];
int main(){
    int T;
    scanf("%d",&T);
    memset(dp,0x7f,sizeof(dp));
    while(T--){
        scanf(" %s",s+1);
        int n=strlen(s+1);
        if(s[n]=='V')dp[n][5]=1;
        else dp[n][1]=1;
        dp[n][0]=1;
        for(int i=n-1;i;i--){
            if(s[i]=='V'){
                for(int j=1;j<=8;j++)dp[i][5]=min(dp[i][5],dp[i+1][j]+1);
                for(int j=1;j<=3;j++)dp[i][j+5]=min(dp[i][j+5],dp[i+1][j]);
            }
            else{
                for(int j=1;j<=8;j++)dp[i][1]=min(dp[i][1],dp[i+1][j]+1);
                dp[i][2]=min(dp[i][2],dp[i+1][1]);
                dp[i][3]=min(dp[i][3],dp[i+1][2]);
                dp[i][4]=min(dp[i][4],dp[i+1][5]);
            }
            for(int j=1;j<=8;j++)dp[i][0]=min(dp[i][0],dp[i][j]);
        }
        //for(int i=1;i<=n;i++)cout<<dp[i][0]<<' ';
        dp[n+1][0]=0;
        int l=1,r=0,m=1;
        for(int i=dp[1][0]-1;~i;i--){
            while(dp[l][0]>i)++l;
            while(dp[r+1][0]>=i&&r<=n)++r;
            //cout<<l<<' '<<r<<endl;
            int mi=9,pos,k=0;
            for(int j=m;j<r;j++){
                switch(s[j]){
                    case 'V':{
                        switch(k){
                            case 0:{
                                k=5;
                                break;
                            }
                            case 1:{
                                k=4;
                                break;
                            }
                        }
                        break;
                    }
                    default:{
                        switch(k){
                            case 0:{
                                k=1;
                                break;
                            }
                            case 1:{
                                k=2;
                                break;
                            }
                            case 2:{
                                k=3;
                                break;
                            }
                            case 5:{
                                k=6;
                                break;
                            }
                            case 6:{
                                k=7;
                                break;
                            }
                            case 7:{
                                k=8;
                                break;
                            }
                        }
                        break;
                    }
                }
                if(j>=l-1){
                    if(k<mi){
                        mi=k;
                        pos=j;
                    }
                }
            }
            m=pos+1;
            ans[i]=mi;
        }
        for(int i=dp[1][0]-1;~i;i--)print(ans[i]);
        Enter;
        for(int i=1;i<=n;i++)for(int j=0;j<=8;j++)dp[i][j]=1e9;
        dp[n+1][0]=1e9;
    }
    return 0;
}