#include <stdio.h>
#include <algorithm>

using namespace std;

#define MAX_N 305
#define FIN "grozavesti.in"
#define FOUT "grozavesti.out"

int N, A[MAX_N][MAX_N], cnt;

void swap_rows(int i, int j)
{
    int k;

    if (i == j) return;
    printf("L %d %d\n", i+1, j+1);
    ++cnt;
    for (k = 0; k < N; ++k)
        swap(A[i][k], A[j][k]);
}

void swap_cols(int i, int j)
{
    int k;

    if (i == j) return;
    printf("C %d %d\n", i+1, j+1);
    ++cnt;
    for (k = 0; k < N; ++k)
        swap(A[k][i], A[k][j]);
}

int main(void)
{
    int i, j, min_pos;

    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);

    scanf("%d", &N);
    for (i = 0; i < N; ++i)
        for (j = 0; j < N; ++j)
            scanf("%d", A[i]+j);

    printf("         \n");
    for (i = 0; i < N; ++i)
    {
        for (min_pos = j = i; j < N; ++j)
            if (A[min_pos][min_pos] > A[j][j]) min_pos = j;
        swap_rows(i, min_pos);
        swap_cols(i, min_pos);
    }
    fseek(stdout, 0, SEEK_SET);
    printf("%d", cnt);

    for (i = 0; i+1 < N; ++i)
        if (A[i][i] > A[i+1][i+1]) fprintf(stderr, "Belea!\n");

    return 0;
}