//#include<algorithm>
//using namespace std;
#include<stdio.h>

#define DIM 301
#define INF 1000001

int n,nrsol,a[DIM][DIM];

struct lc{
	int c0,c1,l0,l1;};
lc b[2*DIM];

void intsc(int x,int y){
	int i,aux;

	b[++nrsol].c0=x;
	b[nrsol].c1=y;
	for(i=1; i<=n; ++i){
		aux=a[i][x];
		a[i][x]=a[i][y];
		a[i][y]=aux;}
	b[nrsol].l0=x;
	b[nrsol].l1=y;
	for(i=1; i<=n; ++i){
		aux=a[x][i];
		a[x][i]=a[y][i];
		a[y][i]=aux;}}

void solve(){
	int i,j,poz,min0;

	scanf("%d",&n);
	for(i=1; i<=n; ++i)
		for(j=1; j<=n; ++j)
			scanf("%d",&a[i][j]);
	for(i=1; i<=n; ++i){
		for(j=i,min0=INF; j<=n; ++j)
			if(a[j][j]<min0){
				min0=a[j][j];
				poz=j;}
		if(poz!=i)
			intsc(poz,i);}
	printf("%d\n",2*nrsol);
	for(i=1; i<=nrsol; ++i)
		printf("C %d %d\nL %d %d\n",b[i].c0,b[i].c1,b[i].l0,b[i].l1);}

int main(){

	freopen("grozavesti.in","r",stdin);
	freopen("grozavesti.out","w",stdout);

    solve();
    return 0;}