#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    if abs(i_start - i_end)%2 == 0 :
        a = j_start - j_end
        b = i_start - i_end
        an = []
        while True:
            if b > n or a > n:
                print('Impossible')
                break
                return
            elif  (b == 0 and a == 0):
                print(len(an))
                print(*an)
                break
                return
            if b > 0 and a > 0:
                b -= 2
                a -= 1
                an.append('UL')
            elif b < 0 and a > 0:
                b += 2
                a -= 1
                an.append('LL')
            elif b > 0 and a < 0:
                b -= 2
                a += 1
                an.append('UR')
            elif b < 0 and a < 0:
                b += 2
                a += 1
                an.append('LR')
            elif b == 0 and a < 0:
                a += 2
                an.append('R')
            elif b== 0 and a > 0:
                a -= 2
                an.append('L')
            elif abs(b)%4 == 0 and b < 0 and (a == 0):
                b += 4
                an.append('LR')
                an.append('LL')
            elif b%4 == 0 and b > 0 and a == 0:
                b -= 4
                an.append('UR')
                an.append('UL')
             
    else:
        print("Impossible")
        return
    #  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)]
    printShortestPath(n, i_start, j_start, i_end, j_end)