#!/bin/python3

import sys
def printlen(n,i1,j1,i2,j2,arr):
    if i1>n-1 or i1<0 or j1>n-1 or j1<0:
        print("Impossible")
        return 
    if i1==i2 and j1==j2:
        print(len(arr))
        str=arr[0]
        for i in range(1,len(arr)):
            str+=" "+arr[i]
        print(str)
        return
    elif i1>i2:
        if j1>=j2:
            arr.append("UL")
            i1=i1-2
            j1=j1-1
        else:
            arr.append("UR")
            i1=i1-2
            j1=j1+1
    elif i1<i2:
        if j1>j2:
            arr.append("LL")
            i1=i1+2
            j1=j1-1
        else:
            arr.append("LR")
            i1=i1+2
            j1=j1+1
    elif i1==i2:
        if j1>j2:
            if (j1-j2)%2==0:
                arr.append("L")
                j1=j1-2
            else:
                print('Impossible')
                return 
        elif (j2-j1)%2==0:
            arr.append("R")
            j1=j1+2
        else:
            print("Impossible")
            return
    printlen(n,i1,j1,i2,j2,arr)
        

def printShortestPath(n, i_start, j_start, i_end, j_end):
    arr=[];
    printlen(n, i_start, j_start, i_end, j_end,arr)

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)