# Enter your code here. Read input from STDIN. Print output to STDOUT
n = input()
x,y,i,j = map(int,raw_input().strip().split())
end = (i,j)
step = 0
path = ''
visited = set()
result = None
movs = [(-2,-1,' UL'),(-2,1,' UR'),(0,2,' R'),(2,1,' LR'),(2,-1,' LL'),(0,-2,' L')]
fringe = []
while 1:
    if (x,y) == end:
        if len(path):
            result = [str(step),path[1:]]
        break
    for (i,j,k) in movs:
        _x = x+i
        _y = y+j
        if (_x,_y) in visited:
            continue
        if _x <= n and _x >= 0:
            if _y <= n and _y >= 0:
                fringe.append((_x,_y,path+k,step+1))
                visited.add((_x,_y))
    if len(fringe) == 0:
        break
    x,y,path,step = fringe.pop(0)
if result:
    print '\n'.join(result)
else:
    print 'Impossible'