#include <bits/stdc++.h>
//#define int long long
#define fi first
#define se second 
#define pb push_back
#define ott(i, l, r) for (int i = (l); i <= (r); i ++)
#define tto(i, l, r) for (int i = (r); i >= (l); i --)
using namespace std;
typedef double db;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int read () {
	int x = 0; bool f = false; char c = getchar ();
	while (!isdigit (c)) f |= (c == '-'), c = getchar ();
	while (isdigit (c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar ();
	return f ? -x : x;
}
const int N = 13, mod = 998244353, inf = 0x3f3f3f3f;
char s[4][N], t[4][N], id[3] = {'o', 'g', 'r'};
vector <pair <char, int> > ans;
void work (int i, int x) {
	ans.pb ({id[i], x});
	ott (j, 0, 9) t[i][(j + x) % 10] = s[i][j];
	ott (j, 0, 9) s[i][j] = t[i][j];
	return ;
}
void cork (int x) {
	ans.pb ({'c', x});
	ott (i, 0, 2)
	    ott (j, 0, 2)
	    	t[(i + 3 - x) % 3][j] = s[i][j];
	ott (i, 0, 2)
	    ott (j, 0, 2)
	        s[i][j] = t[i][j];
	return ;
}
void Swap (pair <int, int> x, pair <int, int> y) {
	if (x.se ^ 3) work (x.fi, (13 - x.se) % 10);//x stay 4
	if (y.se) work (y.fi, 10 - y.se);//y remove 1
	int c = (y.fi + 3 - x.fi) % 3;//y -> x
	cork (c), work (x.fi, 9), cork (3 - c);
	return ;
}
int main () {
	ott (i, 0, 2) scanf ("%s", s[i]);
	while (1) {
		pair <int, int> x(-1, -1), y(-1, -1);
		ott (i, 0, 2)
		    ott (j, 0, 9)
		    	if (s[i][j] ^ id[i]) {
		    		if (!~x.fi) x = {i, j};
		    		else if (s[x.fi][x.se] ^ s[i][j]) y = {i, j};
		    	}
		if (!~x.fi) break;
		Swap (x, y);
	}
	printf ("%d\n", ans.size ()); 
	for (pair <char, int> x : ans) printf ("%c%d\n", x.fi, x.se);
    return 0;
}