#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    if((i_end - i_start )% 2 != 0):
        print("Impossible")
        return
    val = ""
    count = 0
    
    while(not(i_start==i_end and j_start==j_end)):
        if(i_start<i_end):
            if(j_start>j_end):
                val = val + "LL "
                count = count + 1
                i_start = i_start + 2
                j_start = j_start - 1
                continue
            else:
                val= val + "LR "
                count = count + 1
                i_start = i_start + 2
                j_start = j_start + 1
                continue
        elif(i_start>i_end):
            if(j_start>j_end):
                val = val + "UL "
                count = count + 1
                i_start = i_start - 2
                j_start = j_start - 1
                continue
            else:
                val= val + "UR "
                count = count + 1
                i_start = i_start - 2
                j_start = j_start + 1
                continue
        else:
            if(abs(j_start-j_end)==1):
                print("Impossible")
                return
            if(j_start>j_end):
                val = val + "L "
                count = count + 1
                j_start = j_start - 2
                continue
            else:
                val= val + "R "
                count = count + 1
                j_start = j_start + 2
                continue
    print(count)
    print(val)
    #  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)