def max_path(pyramid,steps,n):
sol = 1
print sol
path = []
for i in range(1,n):
path.append("R")
print "".join(path)
n = int(raw_input())
pyramid = []
steps = []
for i in range(0,n):
pyramid.append(map(lambda x: int(x), raw_input().strip().split(' ')))
steps.append(['L']*(i+1))
max_path(pyramid,steps,n)
ZGVmIG1heF9wYXRoKHB5cmFtaWQsc3RlcHMsbik6Cglzb2wgPSAxCglwcmludCBzb2wKCglwYXRoID0gW10KCWZvciBpIGluIHJhbmdlKDEsbik6CgkJcGF0aC5hcHBlbmQoIlIiKQoJcHJpbnQgIiIuam9pbihwYXRoKQoKbiA9IGludChyYXdfaW5wdXQoKSkKcHlyYW1pZCA9IFtdCnN0ZXBzID0gW10KZm9yIGkgaW4gcmFuZ2UoMCxuKToKCXB5cmFtaWQuYXBwZW5kKG1hcChsYW1iZGEgeDogaW50KHgpLCByYXdfaW5wdXQoKS5zdHJpcCgpLnNwbGl0KCcgJykpKQoJc3RlcHMuYXBwZW5kKFsnTCddKihpKzEpKQptYXhfcGF0aChweXJhbWlkLHN0ZXBzLG4pCg==