import sys

sys.setrecursionlimit(150000)

d = {1: "UL", 2: "UR", 3: "R", 4: "LR", 5: "LL", 6: "L"}

def trace_route(i1, j1, i2, j2):
    count = 0
    s = []
    while(i1!=i2 or j1!=j2):
        # print("i1 :", i1)
        # print("j1 :", j1)
        # print("i2 :", i2)
        # print("j2 :", j2)
        if (i1-i2 >= 2) and j1-j2>=1:
            s.append(1)
            i1 -= 2
            j1 -= 1
        elif (i1-i2 >= 2) and j2-j1 >=1:
            # s += "UR "
            s.append(2)
            i1 -= 2
            j1 += 1
        elif (i1==i2) and (j2-j1 >=2):
            # s += "R "
            s.append(3)
            j1 += 2
        elif (i2-i1 >= 2) and (j2-j1 >=1):
            # s += "LR "
            s.append(4)
            j1 += 1
            i1 += 2
        elif (i2-i1 >= 2) and (j1-j2 >=1):
            # s += "LL "
            s.append(5)
            j1 -= 1
            i1 += 2
        elif (i1==i2) and (j1-j2 >=2):
            # s += "L "
            s.append(6)
            j1 -= 2
        elif (j2==j1):
            if (i1<i2):
                # s += "LR "
                s.append(4)
                j1 += 1
                i1 += 2
            else:
                # s += "UL "
                s.append(1)
                i1 -= 2
                j1 -= 1

            # print("toot")
        count += 1

    return count, list(sorted(s))




    #     if (i1==i2):
    #         if (j1<j2):
    #             s += "R "
    #             j1 += 2
    #             count += 1
    #         else:
    #             s += "L "
    #             j1 -= 2
    #             count += 1
    #     elif (i1 < i2):
    #         if (j1 <= j2):
    #             s += "LR "
    #             j1 += 1
    #             i1 += 2
    #             count += 1
    #         else:
    #             s += "LL "
    #             i1 += 2
    #             j1 -= 1
    #             count += 1
    #     else:
    #         if (j1 < j2):
    #             s += "UR "
    #             i1 -= 2
    #             j1 += 1
    #             count += 1
    #         else:
    #             s += "UL "
    #             i1 -= 2
    #             j1 -= 1
    #             count += 1
    # return count, s

def is_ok(grid, i, j, n):
    # in the borders
    return (i>=0) and (j>=0) and (i<n) and (j<n) and (not(grid[i][j]))

def propagate(i, j, grid, n):
    grid[i][j] = True
    # UL
    if is_ok(grid, i-2, j-1, n):
        propagate(i-2, j-1, grid, n)
    # UR
    if is_ok(grid, i-2, j+1, n):
        propagate(i-2, j+1, grid, n)
    # R
    if is_ok(grid, i, j+2, n):
        propagate(i, j+2, grid, n)
    # LR
    if is_ok(grid, i+2, j+1, n):
        propagate(i+2, j+1, grid, n)
    # LL
    if is_ok(grid, i+2, j-1, n):
        propagate(i+2, j-1, grid, n)
    # L
    if is_ok(grid, i, j-2, n):
        propagate(i, j-2, grid, n)
n = int(input())
grid = []
for i in range(n):
    l = []
    for j in range(n):
        l.append(False)
    grid.append(l)

# print(grid)

istart, jstart, iend, jend = list(map(int, input().split()))

propagate(istart, jstart, grid, n)

if grid[iend][jend]:
    c, s = trace_route(istart, jstart, iend, jend)
    print(c)
    # print(s)
    s = list(map(lambda x : d[x], s))
    print(" ".join(s))
    # print(s[:-1])
else:
    print("Impossible")