#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    
    
    i_diff = abs(i_start-i_end)
    j_diff = abs(j_start-j_end)
    if(i_diff%2 == 0):
        j_rem = abs(j_diff-i_diff//2)
        if(j_rem%2 == 0):
            i_new = i_start
            j_new = j_start
            i = 0
            steps = []
            while not (i_new == i_end and j_new == j_end):
                if(i_new > i_end and j_new > j_end):
                    steps.append('UL')
                    i_new-=2
                    j_new-=1
                    i+=1
                elif(i_new > i_end and j_new < j_end):
                    steps.append('UR')
                    i_new-=2
                    j_new+=1
                    i+=1
                elif(i_new < i_end and j_new > j_end):
                    steps.append('LL')
                    i_new+=2
                    j_new-=1
                    i+=1
                elif(i_new < i_end and j_new < j_end):
                    steps.append('LR')
                    i_new+=2
                    j_new+=1
                    i+=1
                elif(i_new == i_end and j_new < j_end):
                    steps.append('R')
                    j_new+=2
                    i+=1
                elif(i_new == i_end and j_new > j_end):
                    steps.append('L')
                    j_new-=2
                    i+=1
                elif(i_new > i_end and j_new == j_end):
                    if(j_new>0):
                        steps.append('UL')
                        i_new-=2
                        j_new-=1
                        i+=1
                    else:
                        steps.append('UR')
                        i_new-=2
                        j_new+=1
                        i+=1
                elif(i_new < i_end and j_new == j_end):
                    if(j_new<n-1):
                        steps.append('LR')
                        i_new+=2
                        j_new+=1
                        i+=1
                    else:
                        steps.append('LL')
                        i_new+=2
                        j_new-=1
                        i+=1
            print(i)
            print(" ".join(steps))
        else:
            print("Impossible")
    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)