#!/bin/python3

import sys
def mueve(mov,i_s,j_s,i_e,j_e):
    di=i_e-i_s
    dj=j_e-j_s
    if di%2 != 0:
        return True,mov,i_s,j_s
    if di>0:
        if dj>=2:
            return False,mov+['R'],i_s,j_s+2
        if dj>=0:
            return False,mov+['LR'],i_s+2,j_s+1
        if dj<0:
            return False,mov+['LL'],i_s+2,j_s-1
    if di==0:
        if dj%2 != 0:
            return True,mov,i_s,j_s
        if dj>0:
            return False,mov+['R'],i_s,j_s+2
        if dj<0:
            return False,mov+['L'],i_s,j_s-2
    if di<0:
        if dj<=0:
            return False,mov+['UL'],i_s-2,j_s-1
        if dj>0:
            return False,mov+['UR'],i_s-2,j_s+1
def printShortestPath(n, i_start, j_start, i_end, j_end):
    moves=[]
    imposs=False
    while not imposs and (i_start != i_end or j_start != j_end):
        imposs,moves,i_start,j_start = mueve(moves,i_start,j_start,i_end,j_end)
    if imposs:
        print('Impossible')
    else:
        print(len(moves))
        print(' '.join(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)