#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#define DN 304
#define mp make_pair
#define pb push_back
using namespace std;

int m[DN][DN],a[DN];
vector< pair<int,int> > op;

int main()
{
    int n;
    ifstream f("grozavesti.in");
    ofstream g("grozavesti.out");
    f>>n;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
        {
            f>>m[i][j];
            if(i==j)
                a[++a[0]]=m[i][j];
        }
    sort(a+1,a+n+1);
    int r=1;
    for(int i=1;i<=n;++i)
    {
        for(int j=r+1;j<=n;++j)
            if(m[j][j]==a[i])
            {
                swap(m[j][j],m[r][r]);
                op.pb(mp(j,r)); /// L
                op.pb(mp(j,r)); /// C
                ++r;
                break;
            }
    }
    g<<op.size()<<"\n";
    for(int i=0;i<op.size();++i)
        g<<((i%2==1)?"L ":"C ")<<op[i].first<<" "<<op[i].second<<"\n";
    return 0;
}