#!/bin/python

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end, repCount, printStr):

    if i_start % 2 != i_end % 2:
        print "Impossible"
        return

    if abs(i_start - i_end) % 4 == 0:
        if abs(j_start - j_end) % 2 == 1:
            print "Impossible"
            return
    elif abs(i_start - i_end) % 2 == 0:
        if abs(j_start - j_end) % 2 == 0:
            print "Impossible"
            return

    if i_start == i_end and j_start == j_end:
        print repCount
        print printStr
        return
    else:
        ur = abs(i_start - i_end + 1 + j_start - j_end - 2)
        ul = abs(i_start - i_end - 1 + j_start - j_end - 2)
        l = abs(i_start - i_end - 2 + j_start - j_end)
        ll = abs(i_start - i_end - 1 + j_start - j_end + 2)
        lr = abs(i_start - i_end + 1 + j_start - j_end + 2)
        r = abs(i_start - i_end - 2 + j_start - j_end)
        arr = [ur,ul,l,ll,lr,r]
        arr.sort()
        low = arr[0]

        if ur == low:
            j_start = j_start + 1
            i_start = i_start - 2
            printStr = printStr + "UR "
        elif ul == low:
            j_start = j_start - 1
            i_start = i_start - 2
            printStr = printStr + "UL "
        elif l == low:
            if j_start-j_end > 0:
                j_start = j_start - 2
                i_start = i_start
                printStr = printStr + "L "
            else :
                j_start = j_start + 2
                i_start = i_start
                printStr = printStr + "R "

        elif ll == low:
            j_start = j_start - 1
            i_start = i_start + 2
            printStr = printStr + "LL "
        elif lr == low:
            j_start = j_start + 1
            i_start = i_start + 2
            printStr = printStr + "LR "
        elif r == low:
            j_start = j_start + 2
            i_start = i_start
            printStr = printStr + "RR "


        printShortestPath(n,i_start,j_start,i_end,j_end,repCount + 1,printStr)

    #  Print the distance along with the sequence of moves.


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, 0, "")