#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    if abs(i_end-i_start)%2 ==1  and j_start != j_end:
        print("Impossible")
    elif i_start == i_end:
        if abs(j_end-j_start)%2 ==1:
            print("Impossible")
        else:
            if j_start>j_end:
                print(int((j_start-j_end)/2))
                print('L '*int((j_start-j_end)/2))
            else:
                print(int((j_end-j_start)/2))
                print('R '*int((j_end-j_start)/2))                
    elif (j_end < j_start) and i_start>i_end and abs((i_start-i_end)//2)<=j_start-j_end:
        j = j_start - abs(((i_start-i_end)//2)) 
        if abs((j - j_end))%2==0:
            print(((i_start-i_end)//2)+abs(((j-j_end)//2)))
            print('UL '*((i_start-i_end)//2)+'L'*abs(((j-j_end)//2)))
        else:
            print("Impossible")
    elif (j_end > j_start) and i_start>i_end and abs((i_start-i_end)//2)<=j_end-j_start:
        j = j_start + ((i_start-i_end)//2) 
        if abs((j_end-j))%2==0:
            print(((i_start-i_end)//2)+((j_end-j)//2))
            print('UR '*((i_start-i_end)//2)+'R'*((j_end-j)//2))
        else:
            print("Impossible")        
    elif (j_end > j_start) and i_start<i_end and abs((i_start-i_end)//2)<=j_end-j_start:
        j = j_start + abs(((i_start-i_end)//2)) 
        if abs((j_end-j))%2==0:
            print(abs(((i_start-i_end)//2))+((j_end-j)//2))
            print('LR '*abs(((i_start-i_end)//2))+'R'*abs(((j-j_end)//2)))
        else:
            print("Impossible")
    elif (j_end < j_start) and i_start<i_end and abs((i_start-i_end)//2)<=abs(j_start-j_end):
        j = j_start - abs(((i_start-i_end)//2)) 
        if abs((j - j_end))%2==0:
            print(abs(((i_start-i_end)//2))+abs(((j-j_end)//2)))
            print('LL '*abs(((i_start-i_end)//2))+'L'*abs(((j-j_end)//2)))
        else:
            print("Impossible")            
    elif (j_end < j_start) and i_start>i_end and abs((i_start-i_end)//2)>j_start-j_end:
        i = i_start - ((j_start-j_end)*2) 
        if abs((i - i_end))%4==0:
            print(((j_start-j_end))+((i-i_end)//2))
            print('UL '*((j_start-j_end))+'UL '*((i-i_end)//4)+'UR '*((i-i_end)//4))
        else:
            print("Impossible")
    elif (j_end > j_start) and i_start>i_end and abs((i_start-i_end)//2)>j_end-j_start:
        i = i_start - ((j_end-j_start)*2) 
        if abs((i - i_end))%4==0:
            print(((j_end-j_start))+((i-i_end)//2))
            print('UR '*((j_start-j_end))+'UL '*((i-i_end)//4)+'UR '*((i-i_end)//4))
        else:
            print("Impossible")
    elif (j_end > j_start) and i_start<i_end and abs((i_start-i_end)//2)>j_end-j_start:
        i = i_start + ((j_end-j_start)*2) 
        if abs((i - i_end))%4==0:
            print(((j_end-j_start))+((i_end-i)//2))
            print('LR '*((j_end-j_start))+'LR '*((i_end-i)//4)+'LL '*((i_end-i)//4))
        else:
            print("Impossible")
    elif (j_end < j_start) and i_start<i_end and abs((i_start-i_end)//2)>j_start-j_end:
        i = i_start + ((j_start-j_end)*2) 
        if abs((i - i_end))%4==0:
            print(((j_start-j_end))+((i_end-i)//2))
            print('LL '*((j_start-j_end))+'LR '*((i_end-i)//4)+'LL '*((i_end-i)//4))
        else:
            print("Impossible")
    elif j_start == j_end:
        if abs((i_start-i_end)%4) == 0:
            if i_start>=i_end:
                print((i_start-i_end)//2)
                print('UL '*((i_start-i_end)//4)+'UR '*((i_start-i_end)//4))
            else:
                print((i_end-i_start)//2)
                print('LR '*((i_end-i_start)//4)+'LL '*((i_end-i_start)//4))
                
                
        else:
            print("Impossible")
                
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)