#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
 
using namespace std;
 
void max_path(vector<vector<int> > pyramid, int n) {
	int solution = 1;
	string res = "";
	for (int i=1; i<n; i++) res += 'R';
	cout << solution << endl << res << endl;
}
 
int main() {
	long long int n;
	cin >> n;
	vector<vector<int> > pyramid(n,vector<int>(n,0));
	for (int i=0; i<n; i++) {
		for(int j=0; j<=i; j++) {
			cin >> pyramid[i][j];
		}
	}
	max_path(pyramid,n);
}

I2luY2x1ZGUgPGNzdGRpbz4KI2luY2x1ZGUgPHZlY3Rvcj4KI2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnZvaWQgbWF4X3BhdGgodmVjdG9yPHZlY3RvcjxpbnQ+ID4gcHlyYW1pZCwgaW50IG4pIHsKCWludCBzb2x1dGlvbiA9IDE7CglzdHJpbmcgcmVzID0gIiI7Cglmb3IgKGludCBpPTE7IGk8bjsgaSsrKSByZXMgKz0gJ1InOwoJY291dCA8PCBzb2x1dGlvbiA8PCBlbmRsIDw8IHJlcyA8PCBlbmRsOwp9CgppbnQgbWFpbigpIHsKCWxvbmcgbG9uZyBpbnQgbjsKCWNpbiA+PiBuOwoJdmVjdG9yPHZlY3RvcjxpbnQ+ID4gcHlyYW1pZChuLHZlY3RvcjxpbnQ+KG4sMCkpOwoJZm9yIChpbnQgaT0wOyBpPG47IGkrKykgewoJCWZvcihpbnQgaj0wOyBqPD1pOyBqKyspIHsKCQkJY2luID4+IHB5cmFtaWRbaV1bal07CgkJfQoJfQoJbWF4X3BhdGgocHlyYW1pZCxuKTsKfQ==

NQo3CjMgOAo4IDEgMAoyIDcgNCA0CjQgNSAyIDYgNQo=

5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5