#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    if i_end%2 != i_start%2:
        print('Impossible')
    else:
        if (abs(i_end-i_start)//2)%2==1 and abs(j_end-j_start)%2==0:
            print('Impossible')
        elif (abs(i_end-i_start)//2)%2==0 and abs(j_end-j_start)%2==1:
            print('Impossible')
        else:
            steps = []
            i_now = i_start
            j_now = j_start
            while True:
                if i_now==i_end and j_now==j_end:
                    print(len(steps))
                    for i in steps:
                        print(i, end=' ')
                    break
                else:
                    if i_now == i_end:
                        if j_end-j_now>0:
                            j_now+=2
                            steps.append('R')
                        else:
                            j_now-=2
                            steps.append('L')
                    else:
                        if i_end-i_now<=0 and j_end-j_now<=0:
                            i_now-=2
                            j_now-=1
                            if i_now<0 or i_now >=n or j_now<0 or j_now>=n:
                                i_now+=2
                                j_now+=1
                                i_now-=2
                                j_now+=1
                                steps.append('UR')
                            else:
                                steps.append('UL')
                        elif i_end-i_now<=0 and j_end-j_now>=0:
                            i_now-=2
                            j_now+=1
                            steps.append('UR')
                        elif i_end-i_now>=0 and j_end-j_now>=0:
                            if (j_end-j_now)>((i_end-i_now)//2):
                                j_now+=2
                                steps.append('R')
                            else:
                                i_now+=2
                                j_now+=1
                                if i_now<0 or i_now >=n or j_now<0 or j_now>=n:
                                    i_now-=2
                                    j_now-=1
                                    i_now+=2
                                    j_now-=1
                                    steps.append('LL')
                                else:
                                    steps.append('LR')
                        elif i_end-i_now>=0 and j_end-j_now<=0:
                            i_now+=2
                            j_now-=1
                            steps.append('LL')

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)