#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    if ( (i_start - i_end) % 2 == 1) or ( (i_start - i_end) % 4 == ( (j_start - j_end + 1) % 2) * 2 ):
        print("Impossible")
        return
    s = ""
    curr_i = i_start
    curr_j = j_start
    count = 0
    while curr_i > i_end and (curr_j - j_end) * -2 != (curr_i - i_end):
        s += "UL "
        count += 1
        curr_i -= 2
        curr_j -= 1
    while curr_i > i_end:
        count += 1
        s += "UR "
        curr_i -= 2
        curr_j += 1
    while curr_j < j_end and (curr_j - j_end) * 2 != (curr_i - i_end):
        count += 1
        s += "R "
        curr_j += 2
    while curr_i < i_end and (curr_j - j_end) * -2 != (curr_i - i_end):
        count += 1
        s += "LR "
        curr_i += 2
        curr_j += 1
    while curr_i < i_end:
        count += 1
        s += "LL "
        curr_i += 2
        curr_j -= 1
    while curr_j > j_end:
        count += 1
        s += "L "
        curr_j -= 2
    print(count)
    print(s)

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)