#!/bin/python3

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 % 2 != i_end % 2:
        print ("Impossible")
    elif i_start + j_start - i_end - j_end % 3 == 1:
        print ("Impossible")
    elif i_start % 4 == i_end % 4 and j_start % 4 != j_end % 4:
        print ('Impossible')
        
    elif i_start > i_end :
        l =[]
        for i in range(abs((i_start - i_end)//2)):
            l.append("UL")
        if j_start > j_end:
            for i in range(abs((i_start - i_end)//2)-abs(j_start - j_end) // 2):
                l.append('L')
        if j_start < j_end:
            for i in range((abs((i_start - i_end)//2)-abs(j_start - j_end) // 2)):
                l.append('R')
        print (len(l))
        print(*l, sep=' ')
    else:
        print (2)
        print ('LR LL')
        
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)