#!/bin/python3

import sys

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)
a,b=i_start,j_start
#graph={"ul":[a+2,b-1],"ur":[a+2,b+1],"l":[a,b-2],"ll":[a-2,b-1],"lr":[a-2,b+1]}
counter=0
visited=[]
e=""
def asd(k,l):
    graph = {"LL": [k + 2, l - 1], "LR": [k + 2, l + 1], "L": [k, l - 2], "UL": [k - 2, l - 1], "UR": [k - 2, l + 1]}
    reverse = {str(v): k for k, v in graph.items()}
    x=[]
    y=[]
    global counter,e
    if (k,l)==(i_end,j_end):

        print(counter)
        print(e)
    elif [k,l] not in visited:
        visited.append([k, l])
        for i in graph.keys():
            if 0<=graph[i][0]<n and 0<=graph[i][1]<n:
                x.append(graph[i])
                y.append(abs(i_end-graph[i][0])+abs(j_end-graph[i][1]))
        c=y.index(min(y))

        k,l=x[c][0],x[c][1]

        e+=reverse[str(x[c])]+" "
        counter+=1
        #print(visited)
        asd(k,l)
    else:
        print("Impossible")
asd(a,b)