#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
using ll = long long;
#define all(p) p.begin(),p.end()
const int INF = 924;

template<class T> bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}


int main(){
    vector S(3,vector<int>(10));
    rep(i,0,3){
        rep(j,0,10){
            char c;
            cin>>c;
            if(c=='o') S[i][j]=0;
            if(c=='g') S[i][j]=1;
            if(c=='r') S[i][j]=2;
        }
    }
    vector<pair<char,int>> ans;
    auto f=[&](int ind,int k) -> void {
        k=(10+k%10)%10;
        if(k==0) return;
        char c;
        if(ind==0) c='o';
        if(ind==1) c='g';
        if(ind==2) c='r';
        ans.push_back({c,k});
        rep(rp,0,k) for(int j=8;j>=0;j--) swap(S[ind][j],S[ind][j+1]);
    };
    auto g=[&](int ind) -> void {
        ans.push_back({'c',ind});
        rep(rp,0,ind) rep(i,0,3) rep(j,0,2){
            swap(S[j][i],S[j+1][i]);
        }
    };
    // swap(S[ind1][0],S[ind2][3])
    // ind1 + 1 == ind2;
    auto op=[&](int ind1) -> void {
        g(2);
        f(ind1+1,9);
        g(1);
        f(ind1+1,1);
    };
    auto out=[&]() -> void {
        rep(i,0,3){
            rep(j,0,10) cout<<S[i][j];
            cout<<endl;
        }
        cout<<endl;
    };
    auto ser=[&](int ind,int num) -> int {
        num=(num%3+3)%3;
        rep(i,0,10) if(S[ind][i]==num) return i;
        return INF;
    };
    auto h=[&](int ind1,int ind2,int n) -> void {
        while(true){
            int a=min(ser(ind1,n+1),ser(ind1,n+2));
            int b=ser(ind2,n);
            if(b==INF) return;
            f(ind1,10-a);
            f(ind2,13-b);
            op(ind1);
        }
    };
    h(1,2,0);
    h(0,1,0);
    h(1,2,1);
    cout<<ans.size()<<"\n";
    for(auto x:ans) cout<<x.first<<x.second<<"\n";
    //out();
}