//fanoiu
# include <bits/stdc++.h>

using namespace std;

const int Nmax = 305;

struct da{int a,b;};
da sol[1000];

int v[305], x, i, j, n, N, nn, Min, pos;

int main ()
{
    freopen("grozavesti.in", "r", stdin);
    freopen("grozavesti.out", "w", stdout);

    scanf("%d\n", &n);

    for (i = 1; i <= n; ++i)
        for (j = 1; j <= n; ++j)
            if (i == j) scanf("%d ", &v[++N]);
                else scanf("%d ", &x);

    for (i = 1; i < n; ++i) {

        Min = v[i], pos = 0;

        for (j = i + 1; j <= n; ++j)
            if (Min > v[j]) v[j] = Min, pos = j;

        if (Min < v[i]) sol[++nn].a = i, sol[nn].b = pos;
    }

    printf("%d\n", 2 * nn);

    for (i = 1; i <= nn; ++i)
        printf("L %d %d\nC %d %d\n", sol[i].a, sol[i].b, sol[i].a, sol[i].b);


    return 0;
}