#include <stdio.h>
#include <stdlib.h>

long n,i,j,a[303][303],ind[303],sol;

int cmp(const void *n1, const void *n2){
    return a[(*(long*)n1)][(*(long *)n2)]-a[(*(long *)n2)][(*(long *)n2)];
}

int main(){
    freopen("grozavesti.in","r",stdin);
    freopen("grozavesti.out","w",stdout);
    
    scanf("%ld",&n);
    for (i=1;i<=n;i++)
        for (j=1;j<=n;j++)
            scanf("%ld",&a[i][j]);
      
    for (i=1;i<=n;i++)
        ind[i]=i;
    qsort(ind,n+1,sizeof(long),cmp);
    
    printf("%ld\n",2*n);
    for (i=1;i<=n;i++)
        if (ind[i]!=i){
           for (j=i+1;j<=n;j++)
               if (ind[j]==i){
                  ind[j]=ind[i];
                  ind[i]=i;
                  sol+=2;
                  printf("C %ld %ld\n",i,j);
                  printf("L %ld %ld\n",i,j);
               }
        }
    for (i=sol+1;i<=2*n;i++)printf("L %ld %ld\n",1,1);
    
return 0;
}