n = int(raw_input())
y1, x1, y2, x2 = map(int, raw_input().split())
shortest = [[None]*n for _ in xrange(n)]
prev = [[None]*n for _ in xrange(n)]
shortest[y1][x1] = 0

q = [(x1, y1, 0)]

while q:
    x, y, dist = q.pop(0)
    for dy, dx, dir in [(-2,-1,'UL'), (-2,1,'UR'), (0,2,'R'), (2,1,'LR'), (2,-1,'LL'), (0,-2,'L')]:
        nx = x+dx
        ny = y+dy
        if nx < 0 or nx >= n or ny < 0 or ny >= n or shortest[ny][nx] is not None:
            continue
        prev[ny][nx] = (dir, x, y)
        shortest[ny][nx] = dist+1
        q.append((nx, ny, dist+1))
if prev[y2][x2] is None:
    print 'Impossible'
else:
    print shortest[y2][x2]
    d, px, py = prev[y2][x2]
    s = ''
    while True:
        s = d + ' ' + s
        if prev[py][px] is None:
            break
        d, px, py = prev[py][px]
    print s.strip()