#include <fstream>
#include <algorithm>

using namespace std;

const int INF = 1 << 30;
const int SIZE = 301;

ifstream fin("grozavesti.in");
ofstream fout("grozavesti.out");

struct event
{
	bool row;
	int p1, p2;
};

void Read();
void Solve();
void Write(bool row, int p1, int p2);

int n;
int a[SIZE][SIZE], nr;
event ev[2 * SIZE];

int main()
{
	Read();
	Solve();
}

void Read()
{
	fin >> n;
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
			fin >> a[i][j];
}

void Solve()
{
	int times = 0;
	for (int k = 1; k <= n; ++k)
	{
		int mx = 0, lin, col;
		for (int i = k; i <= n; ++i)
			for (int j = k; j <= n; ++j)
				if (a[i][j] > mx)
					mx = a[i][j], lin = i, col = j;
		
		if (a[k][k] == mx); else
		{
			if (col != k)
			{
				++times;
				ev[times].row = 0, ev[times].p1 = k, ev[times].p2 = col;
				for (int i = 1; i <= n; ++i) swap(a[i][k], a[i][col]);
			}
			if (lin != k) 
			{
				++times;
				ev[times].row = 1, ev[times].p1 = k, ev[times].p2 = lin;
				for (int i = 1; i <= n; ++i) swap(a[k][i], a[lin][i]);
			}
		}
	}
	fout << times << '\n';
	for (int i = 1; i <= times; ++i)
		Write(ev[i].row, ev[i].p1, ev[i].p2);
}

void Write(bool row, int p1, int p2)
{
	fout << (row == 1 ? 'L' : 'C') << ' ' << p1 << ' ' << p2 << '\n';
}