#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int NMAX = 505, INF = 0x3f3f3f3f;

int N, Mat[NMAX][NMAX];
vector<pair<int, int> > Ans;

int main()
{
    freopen("grozavesti.in", "r", stdin);
    freopen("grozavesti.out", "w", stdout);
    
    scanf("%i", &N);
    for(int i = 1; i <= N; ++ i)
        for(int j = 1; j <= N; ++ j)
            scanf("%i", &Mat[i][j]);
    
    for(int i = 1; i <= N; ++ i)
    {
        int Min = INF, Line;
        for(int j = i; j <= N; ++ j)
            if(Mat[j][j] < Min)
                Min = Mat[j][j], Line = j;
        if(Line != i)
        {
            swap(Mat[Line][Line], Mat[i][i]);
            Ans.push_back(make_pair(i, Line));
        }
    }
    
    printf("%i\n", 2 * Ans.size());
    for(int i = 0; i < Ans.size(); ++ i)
        printf("L %i %i\nC %i %i\n", Ans[i].first, Ans[i].second, Ans[i].first, Ans[i].second);

    return 0;
}