from Queue import Queue

n = int(raw_input())
i1, j1, i2, j2 = map(int, raw_input().split())


q = Queue()
q.put(([''], i1, j1))
cov = set()

res = -1
while not q.empty():
    moves, ic, jc = q.get()
    if ic == i2 and jc == j2:
        res = moves 
        break
    nxt = [('UL', -2, -1), ('UR', -2, 1), ('R', 0, 2), ('LR', 2, 1), ('LL', 2, -1), ('L', 0, -2)]
    for move in nxt:
        name, id, jd = move
        if ic + id >= 0 and ic + id < n:
            if jc + jd >= 0 and jc + jd < n:
                if (ic + id, jc + jd) not in cov:
                    cov.add((ic + id, jc + jd))
                    q.put((moves + [name], ic + id, jc + jd))
if res == -1:
    print "Impossible"
else:
    print len(res) - 1
    print ' '.join(res[1:])