#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ull unsigned long long

string& operator>>=(string& s, int x)
{
    x %= s.length();
    s = s.substr(s.length() - x) + s.substr(0, s.length() - x);
    return s;
}
string& operator<<=(string& s, int x)
{
    x %= s.length();
    s = s.substr(x) + s.substr(0, x);
    return s;
}

void solve()
{
    string s[3];
    cin >> s[0] >> s[1] >> s[2];
    char target[3] = {'o', 'g', 'r'};
    vector<string> ans;
    auto rot = [&](int x) -> void
    {
        assert(x == 1 || x == 2);
        if(x == 1)
            ans.push_back("c2");
        else
            ans.push_back("c1");
        for (int i = 0; i < 3; i++)
        {
            if(x == 1)
            {
                swap(s[0][i], s[1][i]);
                swap(s[0][i], s[2][i]);
            }
            else
            {
                swap(s[0][i], s[1][i]);
                swap(s[1][i], s[2][i]);
            }
        }
    };
    auto outputleft = [&](int x, int p)
    {
        string s;
        s += target[x];
        s += char('0' + 10 - p);
        ans.push_back(s);
        // cout << target[x] << char('0' + 10 - p) << '\n';
    };
    auto outputright = [&](int x, int p)
    {
        string s;
        s += target[x];
        s += char('0' + p);
        ans.push_back(s);
        // cout << target[x] << char('0' + p) << '\n';
    };
    auto trans = [&](int x, int p1, int p2) -> void
    {
        if(p1 > 0)
        {
            s[x] <<= p1;
            outputleft(x, p1);
        }
        if(p2 < 3)
        {
            s[(x + 1) % 3] >>= 3 - p2;
            outputright((x + 1) % 3, 3 - p2);
        }
        else if(p2 > 3)
        {
            s[(x + 1) % 3] <<= p2 - 3;
            outputleft((x + 1) % 3, p2 - 3);
        }
        rot(1);
        s[(x + 1) % 3] <<= 1;
        outputleft((x + 1) % 3, 1);
        rot(2);
    };
    while (1)
    {
        int p[3] = {-1, -1, -1};
        for (int i = 0; i < 10; i++)
        {
            if(s[0][i] != 'o')
            {
                p[0] = i;
                break;
            }
        }
        for (int i = 0; i < 10; i++)
        {
            if(s[1][i] == 'o')
            {
                p[1] = i;
                break;
            }
        }
        for (int i = 0; i < 10; i++)
        {
            if(s[2][i] == 'o')
            {
                p[2] = i;
                break;
            }
        }
        if(p[0] == -1)
            break;
        if(p[1] != -1)
        {
            trans(0, p[0], p[1]);
        }
        else
        {
            trans(2, p[2], p[0]);
        }
    }
    while (1)
    {
        int p[3] = {-1, -1, -1};
        for (int i = 0; i < 10; i++)
        {
            if(s[1][i] != 'g')
            {
                p[1] = i;
                break;
            }
        }
        for (int i = 0; i < 10; i++)
        {
            if(s[2][i] == 'g')
            {
                p[2] = i;
                break;
            }
        }
        if(p[1] == -1)
            break;
        if(1)
        {
            trans(1, p[1], p[2]);
        }
    }
    // cout << s[0] << endl
    //      << s[1] << endl
    //      << s[2] << endl;
    cout << ans.size() << '\n';
    for (string s : ans)
    {
        cout << s << '\n';
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    while (t--)
    {
        solve();
    }
}