#include<stdio.h>
int n,a[301][301],x[1001],y[1001];
void solve(){
    int i,j,aux,min,k=0;
    scanf("%d",&n);
    for(i=1; i<=n; ++i)
        for(j=1; j<=n; ++j)
            scanf("%d",&a[i][j]);
    for(i=1; i<=n; ++i){
        min=a[i][i];
        for(j=i+1; j<=n; ++j)
            if(a[j][j]<min){
                min=a[j][j];
                aux=a[i][i];
                a[i][i]=a[j][j];
                a[j][j]=aux;
                x[i]=j;
                y[i]=i;}}
    for(i=1; i<=n; ++i)
        if(x[i])
            ++k;
    printf("%d\n",k);
    for(i=1; i<=n; ++i)
        if(x[i])
            printf("L %d%d\nC %d%d\n",x[i],y[i],x[i],y[i]);}
int main(){
    freopen("grozavesti.in","r",stdin);
    freopen("grozavesti.out","w",stdout);
    solve();
    return 0;}