#include<fstream>
#include<algorithm>
using namespace std;
ifstream in("grozavesti.in");
ofstream out("grozavesti.out");
int v[201][201],n,i,j,g,x,k,m,minim,alfa,beta,s,ok,l,d;
pair<int,int>a[101];
pair<int,int>b[101];
int main(){
in>>n;
for(i=1;i<=n;i++){
    for(j=1;j<=n;j++){
       in>>v[i][j];
    }
}

for(i=1,j=1;j<n;i++,j++){
        minim=0;
        ok=0;
    for(k=i,l=j;k<=n-i+1;l++,k++){
        if(ok==0){
            minim=v[k][l];
            ok=1;
            alfa=k;
            beta=l;
        }
        if(v[k][l]<minim){
            minim=v[k][l];
            alfa=k;
            beta=l;
        }
    }
    if(v[i][j]>minim){
        swap(v[i][j],v[alfa][beta]);
        d++;
        a[d].first=i;
        a[d].second=alfa;
        b[d].first=j;
        b[d].second=beta;
    }
}
out<<d*2<<endl;
for(i=1;i<=d;i++){
    out<<"L "<<a[i].first<<" "<<a[i].second<<endl;
    out<<"C "<<b[i].first<<" "<<b[i].second<<endl;

}


return 0;
}