#!/bin/python

import sys

def printShortestPath(n, i1, j1, i2, j2):
    i=i1-i2
    j=j1-j2
    if i%2 or (i%4 and not j%2) or (not i%4 and j%2) :
        print ('Impossible')
        return()
    else:
        c=0
        m=[]
        while (i or j):
            c+=1
            if (i>0)and(j>=0)and (i1-2)>=0 and (j1-1)>=0:
                m=m+['UL']
                i1-=2
                j1-=1
            elif (i>0)and(j<=0)and (i1-2)>=0 and (j1+1)<n:
                m=m+['UR']
                i1-=2
                j1+=1
            elif (i<=0) and (j<0) and (i!=2*j)and (j1+2)<n:
                m=m+['R']
                j1+=2
            elif (i<0)and(j<=0)and (i1+2)<n and (j1+1)<n: 
                m=m+['LR']
                i1+=2
                j1+=1
            elif (i<0)and(j>=0)and (i1+2)<n and (j1-1)>=0:
                m=m+['LL']
                i1+=2
                j1-=1
            elif not i and (j>0)and (j1-2)>=0:
                m=m+['L']
                j1-=2
            i=i1-i2
            j=j1-j2
        print c
        print (' '.join(m))
        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)