#!/bin/python3

import sys

def can_reach(i_start, j_start, i_end, j_end):
    i_end -= i_start
    j_end -= j_start
    i_end, j_end = abs(i_end), abs(j_end)
    while j_end > 1:
        j_end -= 2
    

def print_shortest_path(n, i_start, j_start, i_end, j_end):
    i_end -= i_start
    j_end -= j_start
    path = []
    while abs(i_end) > 1 or abs(j_end) > 1:
        if i_end == 0:
            if j_end > 0:
                j_end -= 2
                path.append('R')
            else:
                j_end += 2
                path.append('L')
        elif i_end > 0:
            i_end -= 2
            if j_end >= 0:
                j_end -= 1
                path.append('LR')
            else:
                j_end += 1
                path.append('LL')
        else:
            i_end += 2
            if j_end >= 0:
                j_end -= 1
                path.append('UR')
            else:
                j_end += 1
                path.append('UL')
                
    if j_end == 0 and i_end == 0:
        print(len(path))
        print(' '.join(path))
    else:
        print('Impossible')

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)]
    print_shortest_path(n, i_start, j_start, i_end, j_end)