#!/bin/python

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    string=''
    count=0
    for i in range(n):
        if n%2==0:
            print "Impossible"
            return 0
        
        elif ((i_start==i_end) and (j_start==j_end)):
            print count,"\n",string
            return 0
        elif i_start==i_end:
            if j_start<j_end:
                j_start+=2
                string+="R "
                count+=1
            else:
                j_start-=2
                string+="L "
                count+=1
        elif i_start>i_end:
            i_start-=2
            if j_start>j_end:
                j_start-=1
                string+="UL "
                count+=1
            else:
                j_start+=1
                string+="UR "
                count+=1
                
        elif i_start<i_end:
            i_start+=2
            if j_start<j_end:
                j_start+=1
                string+="LR "
                count+=1
            else:
                j_start-=1
                string+="LL "
                count+=1
    #  Print the distance along with the sequence of 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)