#include<fstream>
#include<iostream>
#include<climits>
#include<algorithm>
#include<cstring>
#include<cmath>
#include <vector>
#include <queue>
#include <iomanip>
#include <bitset>
#include <deque>

#define DIM 300

using namespace std;

ifstream f("grozavesti.in");
ofstream g("grozavesti.out");

//ifstream f("in.in");
//ofstream g("out.out");

int n,v[DIM+5],tmp;

struct info{
    char c;
    int x;
    int y;
};

info sol[DIM*DIM+5];
int solk=0;

int main(){

    f>>n;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            f>>tmp;
            if(i==j){
                v[i] = tmp;
            }
        }
    }

    for(int i=1;i<=n;i++){
        int minPoz = i;
        for(int j=i+1;j<=n;j++){
            if(v[minPoz] > v[j]){
                minPoz = j;
            }
        }

        if(i!=minPoz){
            solk++;
            sol[solk] = {'L',i,minPoz};
            solk++;
            sol[solk] = {'C',i,minPoz};

            swap(v[i],v[minPoz]);
        }

    }

    g<<solk<<'\n';
    for(int i=1;i<=solk;i++){
        g<<sol[i].c<<" "<<sol[i].x<<" "<<sol[i].y<<'\n';
    }

    f.close();
    g.close();
    return 0;
}

/**


x a a a
a e a a
a a x a
a a a f


x a a a
a a a e
a a x a
a f a a

x a a a
a f a a
a a x a
a a a e



**/