#!/bin/python3

import sys

#(2i,j) (2i)
def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    i_diff=i_start - i_end
    j_diff=j_start - j_end
    # print(n)
    moveStr=''
    moveCount=0
    if i_diff%2!=0:
        print ('Impossible')
    else:
        #print('num i moves: '+str(i_diff//2))
        #print('j diff: '+str(j_diff))
        if (j_diff - (i_diff//2))%2!=0:
            print('Impossible')
        else:
            while not(i_diff==0 and j_diff==0):
                #print('idiff: '+str(i_diff)+' j_diff: '+str(j_diff)+' j_start: '+str(j_start))
                if i_diff>0  and (j_diff>=-(i_diff/4)) and j_start>0:
                    moveStr+='UL '
                    moveCount+=1
                    i_diff-=2
                    j_diff-=1
                    i_start-=2
                    j_start-=1                  
                elif i_diff>0 and (j_diff<=-(i_diff/4)) and j_start<(n-1):
                    moveStr+='UR '
                    moveCount+=1
                    i_diff-=2
                    j_diff+=1
                    i_start-=2
                    j_start+=1
                elif (j_diff -i_diff//2)<0 and j_diff <0:
                    moveStr+='R '
                    moveCount+=1
                    j_diff+=2
                    j_start+=2
                elif i_diff<0  and (j_diff<= -(i_diff/4)) and j_start<(n-1):
                    moveStr+='LR '
                    moveCount+=1
                    i_diff+=2
                    j_diff+=1
                    i_start+=2
                    j_start+=1
                elif i_diff<0 and (j_diff>=-(i_diff/4)) and j_start>0:
                    moveStr+='LL '
                    moveCount+=1
                    i_diff+=2
                    j_diff-=1
                    i_start+=2
                    j_start-=1
                elif i_diff==0 and j_diff>0:
                    moveStr+='L '
                    moveCount+=1
                    j_diff-=2
                    j_start-=2
                    
                #print('i= '+str(i_diff))
                #print('j= '+str(j_diff))
            print(moveCount)
            print(moveStr)
    #print(i_diff)
    #print(j_diff)

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)