#!/bin/python3

import sys

def printShortestPath(n, i1, j1, i2, j2):
    #  Print the distance along with the sequence of moves.
    if(i1==i2 and j1==j2):
        print('Impossible')
        sys.exit()
    if i1%2==0 and i2%2!=0:
        print('Impossible')
        sys.exit()
    path=[]
    c=0
    while i1!=i2 or j1!=j2:
        if i1>i2 and j1>j2:
            i1=i1-2
            j1=j1-1
            c=c+1
            path.append('UL')
            if i1>6 or i1<0 or j1<0 or j1>6:
                print('Impossible')
                sys.exit()
        if j1==j2 and i1>i2:
            i1=i1-4
            c=c+2
            path.append('UL')
            path.append('UR')
            if i1>6 or i1<0 or j1<0 or j1>6:
                print('Impossible')
                sys.exit()
        if i1==i2 and j1>j2:
            j1=j1-2
            c=c+1
            path.append('L')
            if i1>6 or i1<0 or j1<0 or j1>6:
                print('Impossible')
                sys.exit()
        if i1>i2 and j1<j2:
            i1=i1-2
            j1=j1+1
            c=c+1
            path.append('UR')
            if i1>6 or i1<0 or j1<0 or j1>6:
                print('Impossible')
                sys.exit()
        if i1==i2 and j1<j2:
            j1=j1+2
            c=c+1
            path.append('R')
            if i1>6 or i1<0 or j1<0 or j1>6:
                print('Impossible')
                sys.exit()
        
        if i1<i2 and j1>j2:
            i1=i1+2
            j1=j1-1
            c=c+1
            path.append('LL')
            if i1>6 or i1<0 or j1<0 or j1>6:
                print('Impossible')
                sys.exit()
        if j1==j2 and i1<i2:
            i1=i1+4
            c=c+2
            path.append('LR')
            path.append('LL')
            if i1>6 or i1<0 or j1<0 or j1>6:
                print('Impossible')
                sys.exit()
        
        if i1<i2 and j1<j2:
            i1=i1+2
            j1=j1+1
            c=c+1
            path.append('LR')
            if i1>6 or i1<0 or j1<0 or j1>6:
                print('Impossible')
                sys.exit()
         
    print(c)
    for i in range(len(path)):
        print(path[i],end=' ')

n = int(input().strip())
i1, j1, i2, j2 = input().rstrip().split(' ')
i1, j1, i2, j2 = [int(i1), int(j1), int(i2), int(j2)]
x=printShortestPath(n,i1, j1, i2, j2)