#!/bin/python

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    if (i_start<0 or i_start>=n) or (j_start<0 or j_start>=n) or ((j_start-j_end)%2)!=0:
    	print "Impossible"
    	return 0
    l=[]
    for i in range(0,n):
    	l.append([])
    	for j in range(0,n):
    		l[i].append(0)
    l[i_start][j_start]='start'
    l[i_end][j_end]='end'
    opr=[]
    pointer=l[i_start][j_start]
    while pointer!=l[i_end][j_end]:

		if j_end==j_start:
			if (i_start>i_end) and (i_start-2>=0):
				pointer=l[i_start-2][j_start]
				i_start-=2
				opr.append("L")
				continue
			if i_start<i_end and (i_start+2<n):
				pointer=l[i_start+2][j_start]
				opr.append("R")
				i_start+=2
				continue
		if (i_start>i_end) and (i_start-1>=0):
			if j_start<j_end and (j_start+2<n):
				pointer=l[i_start-1][j_start+2]
				opr.append("LL")
				i_start-=1
				j_start+=2
				continue
			if j_start>j_end and (j_start-2>=0):
				pointer=l[i_start-1][j_start-2]
				opr.append("UL")
				i_start-=1
				j_start-=2
				continue
		if (i_start<i_end) and (i_start+1<n):
			if j_start<j_end and(j_start+2<n):
				pointer=l[i_start+1][j_start+2]
				opr.append("LR")
				i_start+=1
				j_start+=2
				continue
			if j_start>j_end and (j_start-2>=0):
				pointer=l[i_start+1][j_start-2]
				opr.append("UR")
				i_start+=1
				j_start-=2
				continue
		
		if (i_start==i_end) and (i_start-1>=0):
			if (j_start>j_end) and (j_start-2>=0):
				pointer=l[i_start+1][j_start-2]
				opr.append("UL")
				i_start-=1
				j_start-=2
				continue
			
		if (i_start==i_end) and (i_start+1<n):
			if (j_start>j_end) and (j_start-2>=0):
				pointer=l[i_start+1][j_start-2]
				opr.append("UR")
				i_start+=1
				j_start-=2
				continue
			if (j_start<j_end) and (j_start+2<n):
				pointer=l[i_start+1][j_start+2]
				opr.append("LR")
				i_start+=1
				j_start+=2
				continue
		if (i_start==i_end) and (i_start-1>=0):
			if (j_start<j_end) and (j_start+2<n):
				pointer=l[i_start+1][j_start+2]
				opr.append("LL")
				i_start-=1
				j_start+=2
				continue


		break
    if pointer==(l[i_end][j_end]):
    	print len(opr)
    	for i in opr:
    		print i,
    else:
    	print "Impossible"

if __name__ == "__main__":
    n = int(raw_input().strip())
    i_s, j_s, i_e, j_e = raw_input().strip().split(' ')
    i_s, j_s, i_e, j_e = [int(i_s), int(j_s), int(i_e), int(j_e)]
    printShortestPath(n, j_s, i_s, j_e, i_e)