#!/bin/python3

import sys

def printShortestPath(n,a,b,x,y):
    s=''
    while(a!=x and b!=y and a>-1 and a<n and b>-1 and b<n):
        if(abs(a-x)%2!=0):
            return 'Impossible'
        if((abs(a-x)//2)%2!=0 and abs(b-y)%2==0):
            return 'Impossible'
        if(a==x):
            if(abs(b-y)%2!=0):
                return 'Impossible'
            elif(b<y):
                s=s+'R'*(abs(b-y)//2)
            else:
                s=s+'L'*(abs(b-y)//2)
            return s
        if(b==y):
            if(abs(a-x)%4!=0):
                print('Impossible')
            elif(a>x):
                s=s+(abs(a-x)//4)*'UL UR'
            else:
                s=s+(abs(a-x)//4)*'LR LL'
            return s
        else:
            if(a<x and b<y):
                s=s+'LR '
                b=b+1
                a=a+2
            elif(a<x and b>y):
                s=s+'LL '
                a=a+2
                b=b-1
            elif(a>x and b<y):
                s=s+'UR '
                a=a-2
                b=b+1
            else:
                s=s+'UL '
                a=a-2
                b=b-1
    else:
        return 'Impossible'
        
        
    #  Print the distance along with the sequence of moves.

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)]
    r=printShortestPath(n, i_start, j_start, i_end, j_end)
    print(r)