#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    paths = [[""]*n for _ in range(n)]
    visited = [[-1]*n for _ in range(n)]
    
    if i_start == i_end and j_start == j_end:
        print("0")
        print()
        return
    
    visited[i_start][j_start] = 0
    stack = [(i_start, j_start)]
    while stack:
        #print(stack)
        i, j = stack.pop(0)
        cur_path = paths[i][j]
        
        directions = [("UL", (-2, -1)), ("UR", (-2, 1)),("R", (0,2)),("LR", (2,1)),
                     ("LL", (2,-1)),("L", (0,-2))]
        
        for (name, (dx, dy)) in directions:
            ni = i+dx
            nj = j+dy
            if 0 <= ni < n and 0 <= nj < n and visited[ni][nj] == -1:
                visited[ni][nj] = visited[i][j] + 1
                paths[ni][nj] = cur_path + " " + name
                if ni == i_end and nj == j_end:
                    #paths[ni][nj].strip()
                    print(visited[ni][nj])
                    print(paths[ni][nj].strip())
                    return
                stack.append((ni, nj))
    #print(paths)
    print("Impossible")
    return
                

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)