#!/bin/python

import sys

from collections import deque

moves = [('UL', -2,-1), ('UR', -2, 1), ('R', 0,2), ('LR', 2, 1), ('LL', 2, -1), ('L', 0,-2)]

move_idx = dict(zip(*reversed(zip(*enumerate(zip(*moves)[0])))))

def in_board(i, j,n):
  return i>=0 and i<n and j>=0 and j<n


def bfs(n, i_start, j_start, i_end, j_end):
  #  Print the distance along with the sequence of moves.
  visited = [[False]*n for _ in range(n)]
  trace = [[None]*n for _ in range(n)]

  Q = deque([(i_start, j_start)])
  visited[i_start][j_start] = True

  while Q:
    i, j = Q.popleft()

    for move, di, dj in moves:
      next_i, next_j = i+di, j+dj
      if in_board(next_i, next_j, n) and not visited[next_i][next_j]:
        trace[next_i][next_j] = move
        Q.append((next_i, next_j))
        visited[next_i][next_j] = True
        if (next_i, next_j) == (i_end, j_end):
          return trace
  return trace

def printShortestPath(n, i_start, j_start, i_end, j_end):  
  #  Print the distance along with the sequence of moves.
  trace = bfs(n, i_start, j_start, i_end, j_end)

  if trace[i_end][j_end] is None:
    print("Impossible")
    return

  backtrack = []
  i, j = i_end, j_end
  while (i,j) != (i_start, j_start):
    backtrack.append(trace[i][j])
    _, di, dj = moves[move_idx[trace[i][j]]]
    i -= di
    j -= dj

  print(len(backtrack))
  print(' '.join(reversed(backtrack)))


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)