#!/bin/python3

import sys



def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    idiff = abs(i_start-i_end)
    jdiff = abs(j_start-j_end)
    if(idiff%2 !=0):
        print("Impossible")
        return
    jdiffcomi = jdiff - int(idiff/2)
    if(jdiffcomi%2!=0):
        print("Impossible")
        return
    direc = 'b'
    if(i_start>i_end):
        direc = 't'
    elif(i_start==i_end):
        direc = 's'
    currPos = [i_start,j_start]
    dist = 0
    finalPath =''
    path = {
        's': ['L','R'],
        't': ['UL','UR'],
        'b': ['LR','LL']
    }
    while(currPos[0] != i_end or currPos[1] != j_end):
        if(currPos[0] == i_end):
            if(j_end > currPos[1]):
                finalPath += path['s'][1]+' '
                currPos[1] += 2
            else:
                finalPath += path['s'][0]+' '
                currPos[1] -= 2
        else:
            if(j_end > currPos[1]):
                finalPath += path[direc][1]+' '
                currPos[1] += 1
            else:
                finalPath += path[direc][0]+' '
                currPos[1] -= 1
            if(direc == 't'):
                currPos[0] -= 2
            else:
                currPos[0] += 2
        dist+=1
    print(dist)
    print(finalPath)
    

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)