#!/bin/python3

import sys
f=[]
def L(n,a,b):
    b=b-2
    if ( b>-1 and a>-1 ):
        return True
    else:
        return False
def R(n,a,b):
    b=b+2
    if ( b<n-1 and a>n-1 ):
        return True
    else:
        return False
def nl(a,b):
    f.append('L')
    return a,b-2
def nr(a,b):
    f.append('R')
    return a,b+2
def pupper(n,a,b):
    s=[False,False]
    if a>1 and b>0:
        s[0]=True
    if a>1 and b<n-1:
        s[1]=True
    return s
def plower(n,a,b):
    s=[False,False]
    if a<n-2 and b>0:
        s[0]=True
    if a<n-2 and b<n-1:
        s[1]=True
    return s
def URight(a,b):
    f.append('UR')
    return a-2,b+1
def ULeft(a,b):
    f.append('UL')
    return a-2,b-1
    
def LRight(a,b):
    f.append('LR')
    return a+2,b+1
def LLeft(a,b):
    f.append('LL')
    return a+2,b-1
def leftoright(a,b):
    return 'L' if(abs(b-a+1) <abs(b-a-1)) else 'R'
        
def getpossiblemoves(n,a,b,c,d):
    i=True
    while (a!=c or b!=d or i):
        left,right=L(n,a,b),R(n,a,b)
        UL,UR=pupper(n,a,b)
        LL,LR=plower(n,a,b)
        #print(left,right,UL,UR,LL,LR,a,b,c,d)
        if(a==c and b==d):
            i=False
            continue
        if a<0 or a >n-1 or b<0 or b >n-1  :
            i=False
            f.append('Impossible');
            break;
            
        if (left or right or UL or UR or LL or LR):
                if(a==c):
                    if(b<d):
                        a,b=nr(a,b)
                        #print('R',a,b)
                    
                    elif (b>d):
                        a,b=nl(a,b)
                        #print('L',a,b)
                    
                else:
                    if (a<c):
                        if (LL and (not LR)):
                            a,b=LLeft(a,b)
                        elif ((not LL) and  LR):
                            a,b=LRight(a,b)
                        else:
                            k=leftoright(b,d)
                            if k=='L':
                                a,b=LLeft(a,b)
                            else:
                                a,b=LRight(a,b)
                            
                    else:
                        if (UL and (not UR)):
                            a,b=ULeft(a,b)
                        
                        elif ((not UL) and  UR):
                            a,b=URight(a,b)
                        else:
                            k=leftoright(b,d)
                            if k=='L':
                                a,b=ULeft(a,b)
                            else:
                                a,b=URight(a,b)
                
        else:
            i=false
            f.append('Impossible')
            break

def printShortestPath(n, i_start, j_start, i_end, j_end):
    if i_start<0 or i_start >n-1 or j_start <0 or j_start>n-1 or i_end<0 or i_end >n-1 or j_end >n-1 or j_end<0 :
        print('Impossible')
        return
    global f
    f=[]
    getpossiblemoves(n,i_start,j_start,i_end,j_end)
    if 'Impossible' in f:
        print('Impossible')
    else:
        print(len(f))
        print(*f)
            
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)