#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    
    i=i_end-i_start
    j=j_end-j_start
    
    if i%2!=0 or (j-i/2)%2!=0:
        print('Impossible')
        return 0
    def short(i,j,m):#0,2,mlr
        i=abs(i)
        j=abs(j)
        print(i//2+(j-i//2)//2)
        print((m[0]+' ')*(i//2), end='')
        print((m[1]+' ')*((j-i//2)//2))
    
    mul=['UL','L']
    mur=['UR','R']
    mll=['LL','L']
    mlr=['LR','R']
    if i<=0 and j<0:
        short(i,j,mul)
    elif i<=0 and j>0:
        short(i,j,mur)
    elif i>=0 and j>0:#4,2
        i=abs(i)
        j=abs(j)
        print(i//2+(j-i//2)//2)
        print(((mlr[1]+' ')*((j-i//2)//2)),end='')
        print((mlr[0]+' ')*(i//2), end='')
    elif i>=0 and j<0:
        short(i,j,mll)
    elif j==0 and i<0:
        i=abs(i)
        print(i//2)
        for k in range(i//2):
            if k%2==0:
                print('UL',end=' ')
            else:
                print('UR',end=' ')
    elif j==0 and i>0:
        print(i//2)
        for k in range(i//2):
            if k%2==0:
                print('LR',end=' ')
            else:
                print('LL',end=' ')
        
        
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)