#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template <typename T> using vc = vector<T>;
template <typename T> using vvc = vector<vector<T>>;
template <typename T> using vvvc = vector<vector<vector<T>>>;
template<class T> using pq = priority_queue<T,vector<T>,greater<T>>;
template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }
template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }

int dx4[] = {1,0,-1,0};
int dy4[] = {0,1,0,-1};

#define overload5(a, b, c, d, e, name, ...) name
#define overload4(a, b, c, d, name, ...) name
#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)
#define REP1(i, n) for(ll i = 0; i < (n); ++i)
#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)
#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)
#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)
#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)
#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))
#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)
#define setbits(j, n) for(ll iiiii = (n), j = lowbit(iiiii); iiiii; iiiii ^= 1 << j, j = lowbit(iiiii))
#define perm(v) for(bool permrepflag = true; (permrepflag ? exchange(permrepflag, false) : next_permutation(all(v)));)
#define fi first
#define se second
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define drop(s) cout << #s << endl, exit(0)
#define si(c) (int)(c).size()
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define lbg(c, x) distance((c).begin(), lower_bound(all(c), (x), greater{}))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define ubg(c, x) distance((c).begin(), upper_bound(all(c), (x), greater{}))
#define rng(v, l, r) v.begin() + (l), v.begin() + (r)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define SORT(v) sort(all(v))
#define REV(v) reverse(all(v))
#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))

vc<pair<char,int>>ans;

bool solve(string &a,string &b,char c1,char c2,char s1,char s2,int i1,int i2) {
    int id1 = -1,id2 = -1;
    rep(i,10) {
        if(a[i] == c1) {
            id1 = i;
        }
    }
    rep(i,10) {
        if(b[i] == c2) {
            id2 = i;
        }
    }
    if(id1 == -1 || id2 == -1) return false;
    if(id1 != i1) {
        int res = (i1+10-id1)%10;
        ans.pb({s1,res});
        string nxt = a;
        rep(i,10) {
            nxt[(i+res)%10] = a[i];
        }
        a = nxt;
    }
    if(id2 != i2) {
        int res = (i2+10-id2)%10;
        ans.pb({s2,res});
        string nxt = b;
        rep(i,10) {
            nxt[(i+res)%10] = b[i];
        }
        b = nxt;
    }
    return true;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    string s1,s2,s3;
    cin >> s1 >> s2 >> s3;
    auto chan = [&](char c,int s) {
        ans.pb({c,s});
        if(c == 'o') {
            string nxt = s1;
            rep(i,10) {
                nxt[(i+s)%10] = s1[i];
            }
            s1 = nxt;
        }
        if(c == 'g') {
            string nxt = s2;
            rep(i,10) {
                nxt[(i+s)%10] = s2[i];
            }
            s2 = nxt;
        }
        if(c == 'r') {
            string nxt = s3;
            rep(i,10) {
                nxt[(i+s)%10] = s3[i];
            }
            s3 = nxt;
        }
        if(c == 'c') {
            if(s == 1) {
                string n1 = s1;
                s1[0] = s2[0],s1[1] = s2[1],s1[2] = s2[2];
                s2[0] = s3[0],s2[1] = s3[1],s2[2] = s3[2];
                s3[0] = n1[0],s3[1] = n1[1],s3[2] = n1[2];
            }
            if(s == 2) {
                string n1 = s1;
                string n2 = s2;
                s1[0] = s3[0],s1[1] = s3[1],s1[2] = s3[2];
                s2[0] = n1[0],s2[1] = n1[1],s2[2] = n1[2];
                s3[0] = n2[0],s3[1] = n2[1],s3[2] = n2[2];
            }
        }
    };
    while(solve(s1,s2,'g','o','o','g',3,0)) {
        chan('c',1);
        chan('o',9);
        chan('c',2);
    }
    while(solve(s1,s2,'r','o','o','g',3,0)) {
        chan('c',1);
        chan('o',9);
        chan('c',2);
    }
    while(solve(s1,s3,'g','o','o','r',0,3)) {
        chan('c',1);
        chan('r',9);
        chan('c',2);
    }
    while(solve(s1,s3,'r','o','o','r',0,3)) {
        chan('c',1);
        chan('r',9);
        chan('c',2);
    }
    while(solve(s2,s3,'r','g','g','r',9,2)) {
        chan('c',1);
        chan('g',1);
        chan('c',2);
    }
    cout << si(ans) << "\n";
    for(auto i:ans) {
        cout << i.fi << i.se << "\n";
    }
}