#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    
    if(abs((i_start - i_end)) % 2 != 0):
        print("Impossible")        
    else:
        move_i = i_start
        move_j = j_start
        moves = ''
        count = 0
        while(move_i != i_end or move_j != j_end):
            count += 1
            if(move_i - i_end > 0 and move_j - j_end >= 0):
                move_i -= 2
                move_j -= 1               
                moves += 'UL '
            elif(move_i - i_end > 0 and move_j - j_end <= 0):
                move_i -= 2
                move_j += 1               
                moves += 'UR '            
            elif(move_i - i_end < 0 and move_j - j_end <= 0):
                move_i += 2
                move_j += 1               
                moves += 'LR '
            elif(move_i - i_end < 0 and move_j - j_end >= 0):
                move_i += 2
                move_j -= 1               
                moves += 'LL '
            elif(move_i - i_end == 0 and move_j - j_end > 0 and (move_j - j_end) % 2 == 0):
                move_j -= 2                
                moves += 'L '
            elif(move_i - i_end == 0 and move_j - j_end >= 0 (move_j - j_end) % 2 == 0):
                move_j -= 1               
                moves += 'R '
            else: 
                print("Impossible")
                break
        
        print(str(count) + '\n' + 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)