#include<fstream>
using namespace std;
int a[303][303],b[303],i,j,n,p,aux,maxim,S[303],T[303],k;;
int main()
{
	ifstream f("grozavesti.in");
	ofstream g("grozavesti.out");
	f>>n;
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			f>>a[i][j];
	for(i=1;i<=n;i++)
		b[i]=a[i][i];
	//g<<2*(n-1)<<"\n";
	for(i=n;i>=2;i--) {
		//aflu p= poz maximului dintre primele i elemente
		//interschimb a[p] cu a[i]
		maxim = b[1];
		p = 1;
		for(j=2;j<=i;j++)
			if(b[j]>maxim){
				maxim=b[j];
				p=j;
			}
		if (i!=p) {
			aux=b[i];
			b[i]=b[p];
			b[p]=aux;
			S[++k] = i;
			T[k] = p;
			
			//g<<"L "<<i<<" "<<p<<"\n"<<"C "<<i<<" "<<p<<"\n";
		}
	}
	g<<2*k<<"\n";
	for (i=1;i<=k;i++) {
		g<<"L "<<S[i]<<" "<<T[i]<<"\n"<<"C "<<S[i]<<" "<<T[i]<<"\n";
	}
	return 0;
}