#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    x = j_end - j_start
    y = i_end - i_start
    steps = []
    if y % 2 == 1:
        print("Impossible")
        return
    while y != 0:
        if y < 0:
            y += 2
            if x <= 0:
                x += 1
                steps.append("UL")
            else:
                x -= 1
                steps.append("UR")
        else:
            y -= 2
            if x <= 0:
                x += 1
                steps.append("LL")
            else:
                x -= 1
                steps.append("LR")
    
    if x % 2 ==1:
        print("Impossible")
        return
    
    while x != 0:
        if x >= 0:
            x -= 2
            steps.append("R")
        else:
            x += 2
            steps.append("L")
            
    myorder = ['UL', 'UR', 'R', 'LR', 'LL', 'L']
    steps.sort(key=lambda v: myorder.index(v))
    print(len(steps))
    print(" ".join(steps))

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)