#!/bin/python

import sys
#UL, UR, R, LR, LL, L
        
    
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:
        print "Impossible"
        return
    elif ((i_start-i_end)%4==2 and (j_start-j_end)%2==0):
        print "Impossible"
        return
    elif (i_start-i_end)%4==0 and (j_start-j_end)%2==1:
        print "Impossible"
        return
    else:
        count=0
        path=""
        if abs(i_end-i_start)>2*abs(j_end-j_start):
            if i_start>i_end:
                while abs(i_end-i_start)>2*abs(j_end-j_start):
                    count+=1
                    path+="UL "
                    i_start-=2
                    j_start-=1
            elif i_start<i_end:
                while abs(i_end-i_start)>2*abs(j_end-j_start):
                    count+=1
                    path+="LR "
                    i_start+=2
                    j_start+=1
        if i_start<i_end and j_start<j_end:
            while i_end-i_start!=2*(j_end-j_start):
                count+=1
                path+="R "
                j_start+=2
            while i_start!=i_end: 
                count+=1
                path+="LR "
                i_start+=2
        else:
            if i_start>=i_end:
                if j_start<j_end:
                    m="UR "
                    h="R "
                    sign=1
                else:
                    m="UL "
                    h="L "
                    sign=-1
                while i_start!=i_end:
                    count+=1
                    path+=m
                    i_start-=2
                    j_start+=sign
                while j_start!=j_end:
                    count+=1
                    path+=h
                    j_start+=sign*2
            else:
                m="LL "
                h="L "
                while i_start!=i_end:
                    count+=1
                    path+=m
                    i_start+=2
                    j_start-=1
                while j_start!=j_end:
                    count+=1
                    path+=h
                    j_start-=2
        print count
        print path[:-1]
        return


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)