#!/bin/python

import sys

def printShortestPath(n, y0, x0, y1, x1):
    r = []
    while y0 < y1:
        if x0 < x1 or x0 == x1 and x0+1<n: r.append('3'); x0+=1
        else: r.append('4'); x0-=1
        y0+=2
    while y0 > y1:
        if x0 < x1 or x0 == x1 and x0+1<n: r.append('1'); x0+=1
        else: r.append('0'); x0-=1
        y0-=2
    while x0 < x1:
        r.append('2'); x0+=2
    while x0 > x1:
        r.append('5'); x0-=2
    if x0 == x1 and y0 == y1:
        print len(r)
        r.sort()
        s = []
        for t in r:
            if t == '0': s.append('UL')
            if t == '1': s.append('UR')
            if t == '2': s.append('R')
            if t == '3': s.append('LR')
            if t == '4': s.append('LL')
            if t == '5': s.append('L')
        print ' '.join(s)
    else: print 'Impossible'

if __name__ == "__main__":
    n = int(raw_input().strip())
    i_start, j_start, i_end, j_end = raw_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)