#!/bin/python

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    h = i_end - i_start
    w = j_end - j_start
    if i_start >= n or i_start < 0 or j_start >= n or j_start < 0 or i_end >= n or i_end < 0 or j_end >= n or j_end < 0 or h % 2 or (w % 2 - (h/2) % 2):
        print "Impossible"
        return
    step = 0
    route = []
    step += abs(h)/2
    for _ in range(abs(h)/2):
        if h > 0 and w > 0:
            h -= 2
            w -= 1
            route.append('LR')
        elif h > 0 and w < 0:
            h -= 2
            w += 1
            route.append('LL')
        elif h < 0 and w > 0:
            h += 2
            w -= 1
            route.append('UR')
        elif h < 0 and w < 0:
            h += 2
            w += 1
            route.append('UL')
        elif h > 0:
            h -= 2
            w -= 1
            route.append('LR')
        else:
            h += 2
            w -= 1
            route.append('UR')
    step += abs(w)/2
    for _ in range(abs(w)/2):
        if w > 0: route.append('R')
        else: route.append('L')
    print step
    print " ".join(route)
    #  Print the distance along with the sequence of moves.

if __name__ == "__main__":
    n = int(raw_input().strip())
    i_start, j_start, i_end, j_end = raw_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)