import sys
d={}
d[1]="UL"
d[2]="UR"
d[3]="R"
d[4]="LR"
d[5]="LL"
d[6]="L"
z=[0]*1000000
q=[]
l=len(z)
def f(n,x,y,a,b,t):
    global z
    global l
    j=len(t)
    if x>=n or y>=n or x<0 or y<0 or q[x][y]==1 or j>l:
        return
    if x==a and y==b:
        if l>j:
            z=t
            l=j
        return
    q[x][y]=1
    if x>a and y>b:
        return f(n,x-1,y-2,a,b,t+[1])
    if x<a and y>b:
        return f(n,x+1,y-2,a,b,t+[2])
    if x<a and y==b:
        return f(n,x+2,y,a,b,t+[3])
    if x<a:
        return f(n,x+1,y+2,a,b,t+[4])
    f(n,x-1,y+2,a,b,t+[5])
    f(n,x-2,y,a,b,t+[6])
    q[x][y]=0
if __name__ == "__main__":
    n = int(raw_input().strip())
    x,y,a,b = map(int,raw_input().strip().split(' '))
    for i in xrange(n):
        q.append([0]*n)
    f(n,y,x,b,a,[])
    t=len(z)
    if t==1000000:
        print "Impossible"
    else:
        print t
        z.sort()
        for i in z:
            print d[i],