#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    x_o = [-2,-2,0,2,2,0]
    y_o = [-1,1,2,1,-1,-2]
    order = ["UL", "UR", "R", "LR", "LL", "L"]
    oi = i_start - i_end
    oj = j_start - j_end
    p_order = []
    flag = 1
    
    if oi % 2 == 1:
                print("Impossible")
                
                
    else :
        
        while oi != 0 or oj != 0:
            if oi > 0 :
                if oj >= 0 :
                    oi += x_o[0]
                    oj += y_o[0]
                    p_order.append(order[0])
                else :
                    oi += x_o[1]
                    oj += y_o[1]
                    p_order.append(order[1])
            elif oi < 0 :
                if oj <= 0:
                    oi += x_o[3]
                    oj += y_o[3]
                    p_order.append(order[3])
                else :
                    oi += x_o[4]
                    oj += y_o[4]
                    p_order.append(order[4])
            else :
                
                if oj == 1 :
                    print("Impossible")
                    flag =0
                    break
                
                
                elif oj <= 0:
                    oi += x_o[2]
                    oj += y_o[2]
                    p_order.append(order[2])
                else :
                    oi += x_o[5]
                    oj += y_o[5]
                    p_order.append(order[5])
                    
            
        if flag :        
            print(len(p_order))
            print(*p_order, sep =' ')

        

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)