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)