#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    count = 0
    moves = ""
    i = (i_start - i_end)
    j = (j_start - j_end)
    #print (i,j)
    if (not(((abs(i)) % 4) or (abs(j)% 2))) or (not(abs(i)%2) and (abs(j) % 2)):
        while (i>0):
            if (abs(i/2)>=(-j)):
                i -= 2
                j -= 1
                moves = moves + "UL " #;   print (i,j)
                count += 1
            else:
                i -= 2
                j += 1
                moves = moves + "UR " #;   print (i,j)
                count += 1
        while (i<0):
            if (abs(i/2)<=abs(j)):
                i += 2
                j -= 1
                moves = moves + "LL "#;   print (i,j)
                count += 1
            else:
                i += 2
                j += 1
                moves = moves + "LR " #;   print (i,j)
                count += 1
        while ((i == 0) and (j !=0)):
            if j > 0 :
                j -= 2
                moves = moves + "L "#;   print (i,j)
                count += 1
            if j < 0 :
                j += 2
                moves = moves + "R " #;   print (i,j)
                count += 1
        print(count)
        print(moves[:-1])
    else: 
        print("Impossible")
        
    #  Print the distance along with the sequence of 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)