#!/bin/python3

import sys
arr=[[-1,2],[1,2],[2,0],[1,-2],[-1,-2],[0,-2]]
def printShortestPath(n1, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    x=j_end-j_start
    y=i_end-i_start
    st=""
    n=0
    c1=0
    c2=0 # for LL consideration
    c3=0 # for UL UR consideration
    c4=0 # for LR LL consideration
    r=0
    flag=0
    while((x!=0 or y!=0) and flag==0):
        while(x>0 and flag==0):
            if(y>0):
                c1=1
                st+="LR "
                y-=2
                x-=1
                j_start+=1
                i_start+=2
                if(j_start>=n1 or i_start>=n1 or j_start<0 or i_start<0):
                    flag=1
                    break
                n+=1
                if(y<0 or y==1):
                    flag=1
                    break
                if(x==0 and y==0):
                    break
            elif(y==0):
                if(x%2==0):
                    if(c1==1):
                        st="R "+st
                    else:
                        st+="R "
                    x=x-2
                    j_start+=2
                    if(j_start>=n1 or i_start>=n1 or j_start<0 or i_start<0):
                        flag=1
                        break
                    n+=1
                else:
                    flag=1
                    break
            else:
                if(y+2>0):
                    flag=1
                    break
                else:
                    y+=2
                    x-=1
                    st+="UR "
                    r=1
                    n+=1
                    j_start+=1
                    i_start-=2
                    if(j_start>=n1 or i_start>=n1 or j_start<0 or i_start<0):
                        flag=1
                        break
                    if(y>0):
                        flag=1
                        break
        while(x<0 and flag==0):
            if(y>0):
                st+="LL "
                y-=2
                x+=1
                c2=1
                n+=1
                j_start-=1
                i_start+=2
                if(j_start>=n1 or i_start>=n1 or j_start<0 or i_start<0):
                    flag=1
                    break
                if(y<0):
                    flag=1
                    break
                if(x==0 and y==0):
                    break
            elif(y==0):
                while(x<0 and abs(x)%2==0):
                    st+="L "
                    x=x+2
                    j_start-=2
                    if(j_start>=n1 or i_start>=n1 or j_start<0 or i_start<0):                    
                        flag=1
                        break
                    n+=1
                if(x!=0):
                    flag=1
                    break
            else:
                y+=2
                x+=1
                st+="UL "
                n+=1
                j_start-=1
                i_start-=2
                if(j_start>=n1 or i_start>=n1 or j_start<0 or i_start<0):                    
                    flag=1
                    break
                if(y>0):
                    flag=1
                    break
        while(x==0 and flag==0):
            if(y>0):
                if(y%4==0):
                    y-=4
                    if(c2==0 and c4==0):
                        st+="LR LL "
                        c4=1
                    elif(c2==0 and c4==1):
                        st="LR "+st+"LL "
                    else:
                        st="LR LL "+st
                    n+=2
                    i_start+=4
                    if(j_start>=n1 or i_start>=n1 or j_start<0 or i_start<0):                    
                        flag=1
                        break
                else:
                    flag=1
                    break
            elif(y==0):
                break
            else:
                if(abs(y)%4==0):
                    if(r==0 and c3==0):
                        st+="UL UR "
                        c3=1
                    elif(r==0 and c3==1):
                        st="UL "+st+"UR "
                    else:
                        st="UL UR "+st
                    y+=4
                    n+=2
                    i_start-=4
                    if(j_start>=n1 or i_start>=n1 or j_start<0 or i_start<0):                    
                        flag=1
                        break
                    if(y>0):
                        flag=1
                        break
                else:
                    flag=1
                    break
    if(flag==0):
        print(n)
        l=st.strip().split(" ")
        order={"UL":1,"UR":2,"R":3,"LR":4,"LL":5,"L":6}
        order_rev={1:"UL",2:"UR",3:"R",4:"LR",5:"LL",6:"L"}
        st2=[]
        #print(l)
        for i in l:
            st2.append(order[i])
        st2.sort()
        st3=""
        for i in st2:
            st3+=order_rev[i]+" "
        print(st3.strip())
    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)