#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    INF = 1e18
    MOVES = [
        [-2, -1, "UL"],
        [-2, +1, "UR"],
        [ 0, +2, "R"],
        [+2, +1, "LR"],
        [+2, -1, "LL"],
        [ 0, -2, "L"]
    ]
    
    d = [[INF] * n for x in range(n)]
    d[i_end][j_end] = 0
    s = [[i_end, j_end]]
    k = 0
    while k < len(s):
        i, j = s[k]
        k += 1
        for di, dj, c in MOVES:
            if 0 <= i + di < n and 0 <= j + dj < n and d[i + di][j + dj] == INF:
                d[i + di][j + dj] = d[i][j] + 1
                s += [[i + di, j + dj]]
    
    if d[i_start][j_start] == INF:
        print("Impossible")
        return
    
    print(d[i_start][j_start])
    while i_start != i_end or j_start != j_end:
        for di, dj, c in MOVES:
            if 0 <= i_start + di < n and 0 <= j_start + dj < n and d[i_start + di][j_start + dj] == d[i_start][j_start] - 1:
                print(c, end=' ')
                i_start += di
                j_start += dj
                break
        

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