#!/bin/python3

import sys

def printShortestPath(n, y_start, x_start, y_end, x_end):
    #  Print the distance along with the sequence of moves.
            
    moves = []
    max_moves = abs(y_start - y_end) + abs(x_start - x_end)
    while y_start != y_end or x_start != x_end:
        move = ''
        if y_start == y_end:
            move = ''
            if x_start > x_end:
                move += 'L'
                x_start -= 2
            elif x_start <= x_end:
                move += 'R'
                x_start += 2

        else:
            if y_start > y_end:
                move += 'U'  
                y_start -= 2
            elif y_start <= y_end:
                move += 'L'
                y_start += 2
                
            if x_start > x_end:
                move += 'L'
                x_start -= 1
            elif x_start <= x_end:
                move += 'R'
                x_start += 1
        
        moves.append(move)

        if len(moves) > max_moves:
            print('Impossible')
            return
        
    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)