#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    moves = 0
    n_ul=0
    n_ur=0
    n_r=0
    n_l=0
    n_ll=0
    n_lr=0
    i_diff =  i_start-i_end
    j_diff= j_start-j_end
    if(abs(i_diff)%2 != 0 or (abs(j_diff)-abs(i_diff/2))%2!= 0):
        print("Impossible")
    else:
        while(i_diff!=0):
            if(i_diff>0 and j_diff>=0):
                n_ul+=1
                moves+=1
                i_diff-=2
                j_diff-=1
            elif(i_diff>0 and j_diff<0):
                n_ur+=1
                moves+=1
                i_diff-=2
                j_diff+=1
            elif(i_diff<0 and j_diff>0):
                n_ll+=1
                moves+=1
                i_diff+=2
                j_diff-=1
            elif(i_diff<0 and j_diff<=0):
                n_lr+=1
                moves+=1
                i_diff+=2
                j_diff+=1
        while(j_diff!=0):
            if(j_diff>0):
                n_l+=1
                moves+=1
                j_diff-=2
            else:
                n_r+=1
                moves+=1
                j_diff+=2
        print(moves)
        for x in range(n_ul):
            print('UL', end=' ')
        for x in range(n_ur):
            print('UR', end=' ')
        for x in range(n_r):
            print('R', end=' ')
        for x in range(n_lr):
            print('LR', end=' ')
        for x in range(n_ll):
            print('LL', end=' ')
        for x in range(n_l):
            print('L', end=' ')
        #  Print the distance along with the sequence of moves.

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)