#!/bin/python3

import math, sys

def d(a,b,x,y):
    return abs(a-x)+abs(b-y)
    
s = [("UL",(-2,-1)), ("UR",(-2,1)), ("R",(0,2)), ("LR",(2,1)), ("LL",(2,-1)), ("L",(0,-2))]
def printShortestPath(n, i_start, j_start, i_end, j_end):
    i, j = i_end - i_start, j_end - j_start
    if ((i%4==0) and (j%2==0)) or ((i%4==2) and (j%2==1)):
        i, j = i_start, j_start
        p = []
        cc = 0
        while d(i,j,i_end,j_end):
            _, __ = s[sorted((d(i+_[1][0],j+_[1][1],i_end,j_end), ii) for ii, _ in enumerate(s))[0][1]]
            i+=__[0]
            j+=__[1]
            p.append(_)
                #                print("{}, i,j({},{}), jump:{}, nij:({},{})Oldd: {}, Newd: {}, dir:{}".format(cc, i,j, _, i+_[0], j+_[1], d(i,j,i_end,j_end), d(i+_[0],j+_[1],i_end,j_end), __))
#                if d(i,j,i_end,j_end) > d(i+_[0],j+_[1],i_end,j_end):
#                    i+=_[0]
#                    j+=_[1]
#                    cc+=1
#                    p.append(__)
#                    break
        print(len(p))
        print(" ".join(p))
    else:
        print("Impossible")

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)