import sys

def isin(x,y,n):
    if 0<=x<n and 0<=y<n:
        return True
    return False

class node:
    def __init__(self,x,y,n,path):
        self.x=x
        self.y=y
        self.n=n
        self.path=path

def printShortestPath(n, ja, ia, jb, ib):
    #  Print the distance along with the sequence of moves.
    dx=[-1,1,2,1,-1,-2]
    dy=[-2,-2,0,2,2,0]
    dn=["UL","UR","R","LR","LL","L"]
    start=node(ia,ja,0,[])
    q=[start]
    visit=[[0 for i in range(n)] for j in range(n)]
    visit[ia][ib]=1
    while q!=[]:
        k=q.pop(0)
        visit[k.x][k.y]=1
        if k.x==ib and k.y==jb:
            print k.n
            print ' '.join(k.path)
            return None
        for i in range(6):
            x1=k.x+dx[i]
            y1=k.y+dy[i]
            if isin(x1,y1,n) and visit[x1][y1]==0:
                q.append(node(x1,y1,k.n+1,k.path+[dn[i]]))
    print "Impossible"

if __name__ == "__main__":
    n = int(raw_input().strip())
    i_start, j_start, i_end, j_end = raw_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)