#!/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 (i_start-i_end)%2==0:
        turns=[]
        while j_start!=j_end or i_start!=i_end:
            if j_start<=j_end:
                if i_start>i_end:
                    turns.append('UR')
                    j_start+=1
                    i_start-=2
                elif i_start<i_end:
                    turns.append('LR')
                    j_start+=1
                    i_start+=2
                else:
                    turns.append('R')
                    j_start+=2
            elif j_start>j_end:
                if i_start>i_end:
                    turns.append('UL')
                    j_start-=1
                    i_start-=2
                elif i_start<i_end:
                    turns.append('LL')
                    j_start-=1
                    i_start+=2
                else:
                    turns.append('L')
                    j_start-=2 
       
        print(len(turns))
        print(' '.join(turns))
    else:
        print("Impossible")
    
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)