#include<cstdio>
#include<algorithm>
using namespace std;
long long a[400][400],v[1000],i,j,k,n,b[1000],poz[1000],poz2[1000],nr;
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++)
    {
        v[i]=a[i][i];
        b[i]=a[i][i];
    }
    sort(v+1,v+n+1);
    for (i=1;i<=n;i++)
        for (j=i+1;j<=n;j++)
			if (v[i]==b[j])
			{
				swap(b[i],b[j]);
				nr++;
				poz[nr]=i;
				poz2[nr]=j;
				break;
			}
	printf("%ld\n",nr*2);
	for(i=1;i<=nr;i++)
		printf("L %ld %ld\nC %ld %ld\n",poz[i],poz2[i],poz[i],poz2[i]);
    return 0;
}