from collections import deque

moves = [
		('UL', -2, -1), 
		('UR', -2, 1),
		('R', 0, 2), 
		('LR', 2, 1),
		('LL', 2, -1), 
		('L', 0, -2) 
		]

n = int(input())
(si, sj, ti, tj) = map(int, input().split())


unvisited=set()
for i in range(n):
	for j in range(n):
		unvisited.add((i,j))

q = deque()
q.append(((si,sj),-1,None))
unvisited.remove((si,sj))

#print(unvisited)

i=0
while(unvisited and i<len(q)):
	(node, parent, parentMove) = q[i]
	if (node==(ti, tj)):
		break

	for (move, di, dj) in moves:
		newNode = (node[0]+di, node[1]+dj)
		if (newNode in unvisited):
			unvisited.remove(newNode)

			#print(newNode)

			q.append((newNode, i, move))

	i+=1
		

if i>=len(q):
	print('Impossible')

else:
	result=[]
	(node, parent, parentMove) = q[i]
	while(parent>=0):
		#print(node, parentMove)
		result.append(parentMove)
		(node, parent, parentMove) = q[parent]


	result.reverse()
	print(len(result))
	print(' '.join(result))