#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
char o[11],g[11],r[11],tmp[11];
vector<pair<char,int>>ans;
void rot(char a[],int t)
{
    rep(i,10-t)tmp[i+t]=a[i];
    rep(i,t)tmp[i]=a[10-t+i];
    rep(i,10)a[i]=tmp[i];
}
void rot(char typ,int t)
{
    if(typ=='o')rot(o,t);
    else if(typ=='g')rot(g,t);
    else if(typ=='r')rot(r,t);
    else
    {
        rep(tim,t)
        {
            rep(i,3)tmp[i]=o[i],o[i]=g[i],g[i]=r[i],r[i]=tmp[i];
        }
    }
    ans.pb(mp(typ,t));
}
bool ready_7(char a[],char c)
{
    for(int i=4;i<=10;i++)if(a[i]!=c)return 0;
    return 1;
}
bool ready_3(char a[],char c)
{
    rep(i,3)if(a[i]!=c)return 0;
    return 1;
}
int main()
{
    scanf("%s%s%s",o+1,g+1,r+1);
    for(;!ready_7(o,'o');)
    {
        int posc,pos;
        rep(i,10)
        {
            if(g[i]=='o'){posc='g';pos=i;break;}
            if(r[i]=='o'){posc='r';pos=i;break;}
        }
        if(pos<3)rot(posc,3-pos);else if(pos>3)rot(posc,13-pos);
        rot('c',posc=='g'?1:2);
        rot('o',1);
    }
    for(;!ready_3(o,'o');)
    {
        int posc,pos;
        rep(i,10)
        {
            if(g[i]=='o'){posc='g';pos=i;break;}
            if(r[i]=='o'){posc='r';pos=i;break;}
        }
        if(pos!=10)rot(posc,10-pos);
        rot('c',posc=='g'?2:1);
        rot(posc,1);
        rot('c',posc=='g'?1:2);
    }
    for(;!ready_7(g,'g');)
    {
        int pos;
        rep(i,10)if(r[i]=='g'){pos=i;break;}
        if(pos<3)rot('r',3-pos);else if(pos>3)rot('r',13-pos);
        rot('c',1);
        rot('g',1);
        rot('c',2);
    }
    for(;!ready_3(g,'g');)
    {
        int pos;
        rep(i,10)if(r[i]=='g'){pos=i;break;}
        if(pos!=10)rot('r',10-pos);
        rot('c',2);
        rot('r',1);
        rot('c',1);
    }
    printf("%d\n",int(ans.size()));
    for(auto [x,y]:ans)printf("%c%d\n",x,y);
    // printf("%s\n%s\n%s\n",o+1,g+1,r+1);
    return 0;
}