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