#include <fstream.h>
using namespace std;

int V[302];
int L[302], C[302];

int n ,i ,a ,p ,k , j, nr, aux, maxim;
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;
			if(i==j){
				V[++p]=a;
//				V[p].b=p;
			}
			
		}
//	sort(V+1 , V+n+1 , cmp);
	for(i=n;i>=1;i--){
		maxim = V[1];
		p = 1;
		for (j=2;j<=i;j++)
			if (V[j]>maxim) {
				maxim = V[j];
				p = j;
			}
		aux = V[p];
		V[p] = V[i];
		V[i] = aux;
		if (i!=p) {
			L[++nr] = i;
			C[nr] = j;
		}
	}
	if(k==i){
		g<<nr*2<<"\n";
		for (i=1;i<=nr;i++) {
			g<<"L "<<L[i]<<" "<<C[i]<<"\n";
			g<<"C "<<L[i]<<" "<<C[i]<<"\n";
		}
	}	
	f.close();
	g.close();
	return 0;
}