#!/bin/python

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    i_diff = i_end - i_start
    j_diff = j_end - j_start
    if (i_diff % 2 != 0) or ((j_diff - (i_diff / 2)) % 2 != 0):
        print "Impossible"
        return
    
    i_curr = i_start
    j_curr = j_start
    counter = 0
    moves = ""
    
    while not (i_curr == i_end and j_curr == j_end):
        if (i_end < i_curr and j_end < j_curr):
            counter += 1
            moves += "UL "
            i_curr -= 2
            j_curr -= 1
        elif (i_end < i_curr and j_end > j_curr):
            counter += 1
            moves += "UR "
            i_curr -= 2
            j_curr += 1
        elif (i_end == i_curr and j_end > j_curr):
            counter += 1
            moves += "R "
            j_curr += 2
        elif (i_end > i_curr and j_end > j_curr):
            counter += 1
            moves += "LR "
            i_curr += 2
            j_curr += 1
        elif (i_end > i_curr and j_end < j_curr):
            counter += 1
            moves += "LL "
            i_curr += 2
            j_curr -= 1
        elif (i_end == i_curr and j_end < j_curr):
            counter += 1
            moves += "L "
            j_curr -= 2
        elif (i_end < i_curr and j_end == j_curr):
            counter += 1
            moves += "UL "
            i_curr -= 2
            j_curr -= 1
        elif (i_end > i_curr and j_end == j_curr):
            counter += 1
            moves += "LR "
            i_curr += 2
            j_curr += 1
            
    print counter
    print 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)