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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    array<array<int, 10>, 3> A;
    for (auto& a : A) {
        for (auto& x : a) {
            char c;
            cin >> c;
            x = (c == 'o' ? 0 : (c == 'r' ? 1 : 2));
        }
    }
    swap(A[1], A[2]);

    vector<string> ans;
    const auto op = [&](int ring, int dist) {
        if (ring == 3) {
            dist %= 3;
            if (dist < 0) dist += 3;
            if (dist == 0) return;
            for (int j = 0; j < 3; ++j) {
                array<int, 3> B;
                for (int i = 0; i < 3; ++i) {
                    B[(i + dist) % 3] = A[i][j];
                }
                for (int i = 0; i < 3; ++i) {
                    A[i][j] = B[i];
                }
            }
        } else {
            dist %= 10;
            if (dist < 0) dist += 10;
            if (dist == 0) return;
            rotate(begin(A[ring]), begin(A[ring]) + (10 - dist), end(A[ring]));
        }
        ans.push_back(string{"orgc"[ring]} + string{(char)('0' + dist)});
    };

    for (int step = 0; step < 2; ++step) {
        while (true) {
            int j = 0;
            while (j < 10 && A[step][j] == step) j += 1;
            if (j == 10) break;
            op(step, 0 - j);

            int i = -1, k = -1;
            for (int x = step + 1; x < 3; ++x) {
                for (int y = 0; y < 10; ++y) {
                    if (A[x][y] == step) {
                        i = x, k = y;
                    }
                }
            }

            op(i, 3 - k);
            op(3, i - step);
            op(i, 9);
            op(3, step - i);
        }
    }

    cout << ans.size() << '\n';
    for (const string& s : ans) {
        cout << s << '\n';
    }

    // for (const auto& a : A) {
    //     for (const int x : a) {
    //         cerr << x;
    //     }
    //     cerr << '\n';
    // }

    return 0;
}