#!/bin/python3

import sys
def printStuff(c, s):
    print(c)
    b = ""
    temp = s.split(" ")
    final = []
    for x in range(0,len(temp)-1):
        if temp[x] == "UL":
            final.append("UL")
    for x in range(0,len(temp)-1):
        if temp[x] == "UR":
            final.append("UR")
    for x in range(0,len(temp)-1):
        if temp[x] == "R":
            final.append("R")
    for x in range(0,len(temp)-1):
        if temp[x] == "LR":
            final.append("LR")
    for x in range(0,len(temp)-1):
        if temp[x] == "LL":
            final.append("LL")
    for x in range(0,len(temp)-1):
        if temp[x] == "L":
            final.append("L")
    for x in range(0,len(final)):
        b = b + final[x] + " "
    print(b)
    
    
def printShortestPath(n, i_start, j_start, i_end, j_end):
    t = ""
    count = 0
    y = i_start
    sy = i_start
    x = j_start
    sx = j_start
    a = i_end
    b = j_end
    if sy > a:
        while(True):
            if sx >= b:
                #ul
                sx -= 1
                sy -= 2
                count += 1
                t = t + "UL "
                if sx < b and sy < a:
                    print("Impossible")
                    return
            elif sx < b:
                #ur
                sx += 1
                sy -= 2
                count += 1
                t = t + "UR "
                if sx > b and sy > a:
                    print("Impossible")
                    return
            if sy == a and sx == b:
                printStuff(count,t)
                return
            elif sy == a and sx != b:
                break
    if sy < a:
        while(True):
            if sx > b:
                #ll
                sx -= 1
                sy += 2
                count += 1
                t = t + "LL "
                if sx < b and sy > a:
                    print("Impossible")
                    return
            elif sx <= b:
                #lr
                sx += 1
                sy += 2
                count += 1
                t = t + "LR "
                if sx > b and sy > a:
                    print("Impossible")
                    return
            if sy == a and sx == b:
                printStuff(count,t)
                return
            elif sy == a and sx != b:
                break
    if sy == a:
        if sx < b:
            while(True):
                #R
                sx += 2
                count += 1
                t = t + "R "
                if sx == b:
                    printStuff(count,t)
                    return
                elif sx > b:
                    print("Impossible")
                    return
        elif sx > b:
            while(True):
                #L
                sx -= 2
                count += 1
                t = t + "L "
                if sx == b:
                    printStuff(count,t)
                    return
                elif sx < b:
                    print("Impossible")
                    return

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)