#include<cstdio>
#include<algorithm>
#define MAXN 310
using namespace std;
int a[MAXN][MAXN],v[MAXN],line[MAXN],column[MAXN];
int main(){
    freopen("grozavesti.in","r",stdin);
    freopen("grozavesti.out","w",stdout);
    int n,i,j,index,smallest,moves=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++){
            scanf("%d",&a[i][j]);
            if(i==j)
                v[i]=a[i][j];
        }
    for(i=1;i<=n;i++){
        smallest=v[i];
        index=i;
        for(j=i+1;j<=n;j++)
            if(smallest>v[j]){
                smallest=v[j];
                index=j;
            }
        if(index!=i){
            moves++;
            line[moves]=i;
            column[moves]=index;
            swap(v[i],v[index]);
        }
    }
    printf("%d\n",2*moves);
    for(i=1;i<=moves;i++){
        printf("C %d %d\n",line[i],column[i]);
        printf("L %d %d\n",line[i],column[i]);
    }
    return 0;
}