#include<cstdio>
#include<algorithm>
using namespace std;
int v[305][305],i,d[305],v1[305],v2[305],k,n,j,poz,schimb;
int main(){
	freopen("grozavesti.in","r",stdin);
	freopen("grozavesti.out","w",stdout);
	scanf("%d",&n);
	for(i=1;i<=n;++i){
		for(j=1;j<=n;++j){
			scanf("%d",&v[i][j]);
			if(i==j){
				d[i]=v[i][j];
			}
		}
	}k=1;
	for(i=1;i<=n;++i){
		poz=0;
		schimb=0;
		for(j=i+1;j<=n;++j){
			if(d[i]>=d[j]){
				schimb=d[i];
				d[i]=d[j];
				d[j]=schimb;
				poz=j;
			}
		}
		if(poz!=0){
			v1[k]=i;
			v2[k]=poz;
			++k;
		}
	}
	printf("%d\n",2*(k-1));
	for(i=1;i<k;++i){
		printf("L %d %d\n",min(v1[i],v2[i]),max(v2[i],v1[i]));
		printf("C %d %d\n",min(v1[i],v2[i]),max(v2[i],v1[i]));
	}
	return 0;
}