#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

vector<string> ans;
int A[10];
int B[10];
int C[10];

void qry(int type, int x)
{
	if(x == 0) return;
	if(type == 0)
	{
		ans.push_back("o" + to_string(x));
		int D[10];
		for(int i = 0; i < 10; ++i) D[i] = A[i];
		for(int i = 0; i < 10; ++i) A[i] = D[(i - x + 10) % 10];
	}
	else if(type == 1)
	{
		ans.push_back("g" + to_string(x));
		int D[10];
		for(int i = 0; i < 10; ++i) D[i] = B[i];
		for(int i = 0; i < 10; ++i) B[i] = D[(i - x + 10) % 10];
	}
	else if(type == 2)
	{
		ans.push_back("r" + to_string(x));
		int D[10];
		for(int i = 0; i < 10; ++i) D[i] = C[i];
		for(int i = 0; i < 10; ++i) C[i] = D[(i - x + 10) % 10];
	}
	else
	{
		ans.push_back("c" + to_string(3 - x));
		int D[3][3];
		for(int i = 0; i < 3; ++i)
		{
			D[0][i] = A[i];
			D[1][i] = B[i];
			D[2][i] = C[i];
		}
		for(int i = 0; i < 3; ++i)
		{
			A[i] = D[3 - x][i];
			B[i] = D[(4 - x) % 3][i];
			C[i] = D[2 - x][i];
		}
	}
}

bool chcA(void)
{
	for(int i = 0; i < 10; ++i) if(A[i] != 0) return false;
	return true;
}

bool chcB(void)
{
	for(int i = 0; i < 10; ++i) if(B[i] != 1) return false;
	return true;
}

void swch(void)
{
	qry(3, 1);
	qry(0, 3);
	qry(3, 2);
	qry(0, 7);
	qry(3, 1);
}

void show(void)
{
	for(int i = 0; i < 10; ++i) cout << A[i] << ' '; cout << '\n';
	for(int i = 0; i < 10; ++i) cout << B[i] << ' '; cout << '\n';
	for(int i = 0; i < 10; ++i) cout << C[i] << ' '; cout << '\n';
	cout << '\n';
}

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);
	
	string st1, st2, st3;
	cin >> st1 >> st2 >> st3;
	// st1 = "ogrogrogro";
	// st2 = "grogrogrog";
	// st3 = "rogrogrogr";
	for(int i = 0; i < 10; ++i)
	{
		if(st1[i] == 'o') A[i] = 0;
		else if(st1[i] == 'g') A[i] = 1;
		else A[i] = 2;
	}
	for(int i = 0; i < 10; ++i)
	{
		if(st2[i] == 'o') B[i] = 0;
		else if(st2[i] == 'g') B[i] = 1;
		else B[i] = 2;
	}
	for(int i = 0; i < 10; ++i)
	{
		if(st3[i] == 'o') C[i] = 0;
		else if(st3[i] == 'g') C[i] = 1;
		else C[i] = 2;
	}

	for(int i = 0; i < 8; ++i)
	{
		if(chcA()) break;
		// show();
		pii k;
		for(int j = 0; j < 10; ++j) if(B[j] == 0) k = {1, j};
		for(int j = 0; j < 10; ++j) if(C[j] == 0) k = {2, j};
		qry(k.ff, (12 - k.ss) % 10);
		qry(3, 3 - k.ff);
		qry(0, 1);
	}
	qry(0, 7);
	for(int i = 0; i < 2; ++i)
	{
		if(chcA()) break;
		pii k;
		for(int j = 0; j < 10; ++j) if(B[j] == 0) k = {1, j};
		for(int j = 0; j < 10; ++j) if(C[j] == 0) k = {2, j};
		qry(k.ff, (12 - k.ss) % 10);
		qry(3, 3 - k.ff);
		qry(0, 1);
		qry(3, k.ff);
	}
	// show();
	// assert(chcA());

	for(int i = 0; i < 8; ++i)
	{
		if(chcB()) break;
		int k;
		for(int j = 0; j < 10; ++j) if(C[j] == 1) k = j;
		qry(2, (12 - k) % 10);
		swch();
		qry(1, 1);
	}
	qry(1, 7);
	for(int i = 0; i < 2; ++i)
	{
		if(chcB()) break;
		int k;
		for(int j = 0; j < 10; ++j) if(C[j] == 1) k = j;
		qry(2, (12 - k) % 10);
		swch();
		qry(1, 1);
		swch();
	}
 
	cout << ans.size() << '\n';
	for(auto s : ans) cout << s << '\n';

	// show();
}