#!/bin/python3

import sys

def printShortestPath(n, ist, jst, ien, jen):
    s = []
    i = 1
    count = 0
    flag = False
    d = abs(ist - ien) + abs(jst - jen)
    while d!=0 and i <100000:
        k=[100000]*6
        d1 = d
        if jst-1>=0 and ist-2>=0:
            k[0] = (abs(jst-1-jen) + abs(ist-2-ien))
        if jst +1<n and ist-2>=0:
            k[1] = (abs(jst+1-jen) + abs(ist-2-ien))
        if jst +2<n :
            k[2] = abs(jst+2-jen) + abs(ist-ien)  
        if jst+1<n and ist+2<n:
            k[3] = (abs(jst+1-jen) + abs(ist+2-ien))
        if jst-1>=0 and ist+2<n:
            k[4] = (abs(jst-1-jen) + abs(ist+2-ien))
        if jst-2>=0:
            k[5] = (abs(jst-2-jen) + abs(ist-ien))
        l = min(k)
        if l == k[0]:
            count+=1
            jst = jst-1
            ist = ist-2
            s.append(0)
        elif l == k[1]:
            count+=1
            jst =jst +1
            ist = ist -2
            s.append(1)
        elif l == k[2]:
            count+=1
            jst =jst +2
            s.append(2)
        elif l == k[3]:
            count+=1
            jst =jst +1
            ist = ist +2
            s.append(3)
        elif l == k[4]:
            count+=1
            jst =jst -1
            ist = ist +2
            s.append(4)
        elif l == k[5]:
            count+=1
            jst =jst -2
            s.append(5)
        d = abs(ist - ien) + abs(jst - jen)
        i +=1
        if d1<d:
            flag = True
            break
    s.sort()
    for i in range(len(s)):
        if s[i] == 0:
            s[i] = 'UL'
        elif s[i] == 1:
            s[i] = 'UR'
        elif s[i] == 2:
            s[i] = 'R'
        elif s[i] == 3:
            s[i] = 'LR'
        elif s[i] == 4:
            s[i] = 'LL'
        else:
            s[i] = 'L'
    if flag == True or d!=0:
    	print('Impossible')	
    elif d == 0:
    	print(count)
    	print(*s)
    		
         	      	       	       	        	       	
if __name__ == "__main__":
    n = int(input().strip())
    i_start, j_start, i_end, j_end = input().strip().split(' ')
    i_start, j_start, i_end, j_end = [int(i_start), int(j_start), int(i_end), int(j_end)]
    printShortestPath(n, i_start, j_start, i_end, j_end)