import sys

def printShortestPath(n, i_s, j_s, i_e, j_e, d, str, list):

    diff = abs(i_s - i_e) + abs(j_s - j_e)
    if 0 <= i_s < n and 0 <= j_s < n and diff < d:

        list +=(str + " ")
        if i_s == i_e and j_s == j_e:
            return [0, list]

        x1 = printShortestPath(n, i_s - 2, j_s - 1, i_e, j_e, diff, "UL",list)
        x2 = printShortestPath(n, i_s - 2, j_s + 1, i_e, j_e, diff, "UR",list)
        x3 = printShortestPath(n, i_s    , j_s + 2, i_e, j_e, diff, "R",list)
        x4 = printShortestPath(n, i_s + 2, j_s + 1, i_e, j_e, diff, "LR",list)
        x5 = printShortestPath(n, i_s + 2, j_s - 1, i_e, j_e, diff, "LL",list)
        x6 = printShortestPath(n, i_s    , j_s - 2, i_e, j_e, diff, "L",list)

        x = min((x1,x2,x3,x4,x5,x6), key = lambda t: t[0])
        x[0] += 1

        return x

    return [99999, list]

if __name__ == "__main__":
    n = int(input())
    i_s, j_s, i_e, j_e = [int(i) for i in input().split()]
    if abs(i_s - i_e) % 2 == 1 or abs(int(abs(i_s - i_e)/2)-j_e + j_s )%2 == 1:
        print("Impossible")
    else:
        diff = abs(i_s - i_e) + abs(j_s - j_e) + 1
        x = printShortestPath(n, i_s, j_s, i_e, j_e, diff,"", "")
        print(x[0])
        print(x[1].strip())