#!/bin/python

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    
    # (i,j) indicate the current position of the knight
    i = i_start
    j = j_start
    
    # the flag variables ensure that once the knight goes up(down) it should not make any move down(up)
    gone_up = 0
    gone_down = 0
    
    # PATH array stores the priority number of the moves of the knight and path is the dictionary for decoding             # the priorities to associated move name
    PATH = []
    path = {1:'UL',2:'UR',3:'R',4:'LR',5:'LL',6:'L'}
    
    # move the knight only as long as it does not jump out of the board or does not reach its destination or makes an       # invalid move as defined by the flag variables
    while((0<=i<n and 0<=j<n) and not(i==i_end and j==j_end)):
        
        # Compare current position with the destination
        # Dest is UL to current pos
        if(i_end<i and j_end<j and not gone_down):
            gone_up = 1
            i = i - 2
            j = j - 1
            PATH.append(1)
            
        # Dest is UR (including Up) to current pos
        elif(i_end<i and j_end>=j and not gone_down):
            gone_up = 1
            i = i - 2
            j = j + 1
            PATH.append(2)
            
        # Dest is R to current pos
        elif(i_end==i and j_end>j):
            gone_up = 1
            gone_down = 1
            j = j + 2
            PATH.append(3)
            
        # Dest is LR (including Down) to current pos
        elif(i_end>i and j_end>=j and not gone_up):
            gone_down = 1
            i = i + 2
            j = j + 1
            PATH.append(4)
            
        # Dest is LL to current pos
        elif(i_end>i and j_end<j and not gone_up):
            gone_down = 1
            i = i + 2
            j = j - 1
            PATH.append(5)
            
        # Dest is L to current pos
        elif(i_end==i and j_end<j):
            gone_up = 1
            gone_down = 1
            j = j - 2
            PATH.append(6)
            
        # If none of these routes is feasible, print Impossible and exit
        else:
            print("Impossible")
            break
            
    # If the knight reached the destination successfully, print the required output
    if(i==i_end and j==j_end):
        print len(PATH)
        PATH = sorted(PATH)
        for move in PATH:
            print(path[move]),
    else:
        print("Impossible")  
            
            
if __name__ == "__main__":
    n = int(raw_input().strip())
    i_start, j_start, i_end, j_end = raw_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)