import sys
n = int(raw_input())
mat = []
for i in range(0, n):
	mat.append([0]*n)

si, sj, di, dj = map(int, raw_input().strip().split(' '))
path, path2, c = [], [[si, sj]], 0
mnc, mnpath = 1000000000000000001, []

def finder(i, j):
	global path, c, di, dj, mnc, mnpath
	ni, nj = 0, 0
	if i==di and j==dj:
		if c<mnc:
			mnc = c
			mnpath = path[:]
	#UL
	ni, nj = i-2, j-1
	if ni>=0 and nj>=0 and [ni, nj] not in path2:
		path.append("UL")
		path2.append([ni, nj])	
		c+=1
		finder(ni, nj)
		c-=1
		path2.pop()
		path.pop()
	#UR		
	ni, nj = i-2, j+1
	if ni>=0 and nj<n and [ni, nj] not in path2:
		path.append("UR")
		path2.append([ni, nj])		
		c+=1
		finder(ni, nj)
		c-=1
		path2.pop()
		path.pop()	
	#R
	ni, nj = i, j+2
	if nj>=0 and nj<n and [ni, nj] not in path2:
		path.append("R")
		path2.append([ni, nj])		
		c+=1
		finder(ni, nj)
		c-=1
		path2.pop()
		path.pop()
	#LR
	ni, nj = i+2, j+1
	if ni<n and nj<n and [ni, nj] not in path2:
		path.append("LR")
		path2.append([ni, nj])
		c+=1
		finder(ni, nj)
		c-=1
		path2.pop()
		path.pop()
	#LL
	ni, nj = i+2, j-1
	if ni<n and nj>=0 and [ni, nj] not in path2:
		path.append("LL")
		path2.append([ni, nj])		
		c+=1
		finder(ni, nj)
		c-=1
		path2.pop()
		path.pop()
	#L
	ni, nj = i, j-2
	if nj>=0 and nj<n and [ni, nj] not in path2:
		path.append("L")
		path2.append([ni, nj])
		c+=1
		finder(ni, nj)
		c-=1
		path2.pop()
		path.pop()

finder(si, sj)
if mnc==1000000000000000001:
	print "Impossible"
	sys.exit()
print mnc
print " ".join(w for w in mnpath)