#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    paths = ("UL", "UR", "R", "LL", "LR", "L")
    if (j_start - j_end) % 2 != 0:
        if (i_start - i_end) % 2 != 0:
            print("Impossible")
            return
        else:
            if (abs(int((i_start - i_end) / 2)) - abs(j_start - j_end)) % 2 != 0:
                print("Impossible")
                return
    elif (i_start - i_end) % 2 != 0:
        print("Impossible")
        return
        
    current_position = [i_start, j_start]
    if i_start > i_end:
        u = int((i_start - i_end) / 2)        
        if j_start > j_end:
            if l % 4 == 0:
                l = j_start - j_end - u               
                temp = int(l / 4)
                print(u * str(paths[0] + " ") + temp * str(paths[3] + " " +  paths[0] + " "))
            else:
                u = int((i_start - i_end) / 2)
                l = int((j_end - j_start - u) / 2)
                print(u * str(paths[1] + " ") + l * str(paths[5] + " "))
        else:
            r = int((j_end - j_start - u) / 2)
            print(u * str(paths[1]  + " ") + r * str(paths[2] + " "))


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)