#!/bin/python3

import sys

def printShortestPath(n,i1,j1,i2,j2):
    if (i1-i2)%2!=0:
        print("Impossible")
    elif (j1-j2)==0:
        if (i1-i2)%4==0:
            if (i1-i2)>=0:
                print((i1-i2)//2)
                print("UL "*((i1-i2)//4)+"UR "*((i1-i2)//4))
            else:
                print((i2-i1)//2)
                print("LR "*((i2-i1)//4)+"LL "*((i2-i1)//4))
        else:
            print("Impossible")
    elif (i1-i2)==0:
        if (j1-j2)%2==0:
            print(abs((j1-j2)//2))
            if j1>j2:
                
                print("L "*((j1-j2)//2))
            else:
                print("R "*((j2-j1)//2))
        else:
            print("Impossible")
    elif (i1-i2)==2*(j1-j2):
        print(abs(j1-j2))
        if i1>i2:
            print("UL "*((j1-j2)))
        else:
            print("LR "*((j2-j1)))
    elif (i1-i2)==-2*(j1-j2):
        print(abs(j2-j1))
        if i1>i2:
            print("UR "*(j2-j1))
        else:
            print("LL "*(j1-j2))
    elif i1>i2:
        if j1>j2:
            if ((i1-i2)//2-(j1-j2))%2==0:
                print(((i1-i2)//2)+abs(((i1-i2)//2-(j1-j2))//2))
                if ((i1-i2)//2-(j1-j2))>0:
                    
                    print("UL "*((i1-i2)//2)+"R "*(((i1-i2)//2-(j1-j2))//2))
                else:
                    print("UL "*((i1-i2)//2)+"L "*((-(i1-i2)//2+(j1-j2))//2))
            else:
                print("Impossible")
        else:
            if ((i1-i2)//2-(j2-j1))%2==0:
                print(((i1-i2)//2)+abs(((i1-i2)//2-(j2-j1))//2))
                if ((i1-i2)//2-(j2-j1))>0:
                    print("UR "*((i1-i2)//2)+"L "*(((i1-i2)//2-(j2-j1))//2))
                else:
                    print("UR "*((i1-i2)//2)+"R "*((-(i1-i2)//2+(j2-j1))//2))
            else:
                print("Impossible")
    elif i1<i2:
        if j1>j2:
            if ((i2-i1)//2-(j1-j2))%2==0:
                print(((i2-i1)//2)+abs(((i2-i1)//2-(j1-j2))//2))
                if ((i2-i1)//2-(j1-j2))>0:
                    
                    print("R "*(((i2-i1)//2-(j1-j2))//2)+"LL "*((i2-i1)//2))
                else:
                    print("LL "*((i2-i1)//2)+"L "*((-(i2-i1)//2+(j1-j2))//2))
            else:
                print("Impossible")
        else:
            if ((i2-i1)//2-(j2-j1))%2==0:
                print(((i2-i1)//2)+abs(((i2-i1)//2-(j2-j1))//2))
                if ((i1-i2)//2-(j2-j1))>0:
                    print("LR "*((i2-i1)//2)+"L "*(((i2-i1)//2-(j2-j1))//2))
                else:
                    print("R "*((-(i2-i1)//2+(j2-j1))//2)+"LR "*((i2-i1)//2))
            else:
                print("Impossible")
            
            
                    
            
                    
                
                
    
        
        
    #  Print the distance along with the sequence of moves.

if __name__ == "__main__":
    n = int(input().strip())
    i1,j1,i2,j2 = input().strip().split(' ')
    i1,j1,i2,j2 = [int(i1), int(j1), int(i2), int(j2)]
    printShortestPath(n, i1,j1,i2,j2)