#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    if (i_start+i_end)%2==1:
        print('Impossible')
        return
    if (i_start-i_end)%4==0 and (j_start-j_end)%2==1:
        print('Impossible')
        return
    if (i_start-i_end)%4==2 and (j_start-j_end)%2==0:
        print('Impossible')
        return
    p=''
    i_now=i_start
    j_now=j_start
    x=0
    while i_now!=i_end or j_now!=j_end:
        x=x+1
        if p!='':
            p=p+' '
        if i_now>i_end:
            if not j_now<j_end:
                p=p+'UL'
                i_now=i_now-2
                j_now=j_now-1
            else:
                p=p+'UR'
                i_now=i_now-2
                j_now=j_now+1
        elif j_now<j_end:
            if (i_end-i_now)==2*(j_end-j_now):
                p=p+'LR'
                i_now=i_now+2
                j_now=j_now+1
            else:
                p=p+'R'
                j_now=j_now+2
        elif j_now==j_end:
            p=p+'LR'
            i_now=i_now+2
            j_now=j_now+1
        elif i_now<i_end:
            p=p+'LL'
            i_now=i_now+2
            j_now=j_now-1
        else:
            p=p+'L'
            j_now=j_now-2
    print(x)
    print(p)


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)