#!/bin/python
from collections import deque
import sys

dname = ['UL', 'UR', 'R', 'LR', 'LL', 'L']
dr = [-2, -2, 0, 2, 2, 0]
dc = [-1, 1, 2, 1, -1, -2]
def solve(n, r1, c1, r2, c2):
  p1 = r1 * n + c1
  p2 = r2 * n + c2
  q = deque()
  link = [None] * (n * n)
  link[p1] = (p1, '')
  q.append(p1)
  while q:
    cur = q.popleft()
    cur_r, cur_c = cur / n, cur % n
    for i in xrange(6):
      r, c = cur_r + dr[i], cur_c + dc[i]
      if r >= 0 and r < n and c >= 0 and c < n:
        v = r * n + c
        if link[v] is None:
          link[v] = (cur, dname[i])
          q.append(v)
  if link[p2] is None:
    print('Impossible')
  else:
    path = []
    cur = p2
    while cur != p1:
      path.append(link[cur][1])
      cur = link[cur][0]
    print(len(path))
    print(' '.join(path[::-1]))

if __name__ == "__main__":
  n = int(raw_input().strip())
  r1, c1, r2, c2 = (int(tok) for tok in raw_input().strip().split())
  solve(n, r1, c1, r2, c2)