#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    i_d = abs(i_end - i_start) 
    j_d = abs(j_end - j_start)
    
    if i_d % 2 or not (j_d % 2) == (i_d % 4 != 0):
        print('Impossible')
        return
    
    i_cur = i_start
    j_cur = j_start
    moves = []
    
    while i_cur != i_end or j_cur != j_end:
        if i_cur > i_end and j_cur >= j_end: move = 'UL' if j_cur else 'UR'
        elif i_cur > i_end and j_cur <= j_end: move = 'UR' if j_cur != n-1 else 'UL'
        elif i_cur == i_end and j_cur <= j_end: move = 'R'
        elif i_cur < i_end and j_cur <= j_end: move = 'LR' if j_cur != n-1 else 'LL'
        elif i_cur < i_end and j_cur >= j_end: move = 'LL' if j_cur else 'LR'
        elif i_cur == i_end and j_cur >= j_end: move = 'L'
        
        moves.append(move)
        
        if move == 'UL':
            i_cur -= 2
            j_cur -= 1
        elif move == 'UR':
            i_cur -= 2
            j_cur += 1
        elif move == 'R':
            j_cur += 2
        elif move == 'LR':
            i_cur += 2
            j_cur += 1
        elif move == 'LL':
            i_cur += 2
            j_cur -= 1
        elif move == 'L':
            j_cur -= 2
    print(len(moves))
    print(' '.join(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)