#!/bin/python3

import sys

def onBoard(n, x, y):
    return (x>=0) & (x<n) & (y>=0) & (y<n)

def BFS(n, board, leaves):
    nextLeaves=[]
    moves=[[-2,-1,'UL'], [-2,1,'UR'],[0,2,'R'],[2,1,'LR'],[2,-1,'LL'],[0,-2,'L']]
    for L in leaves:
        x,y,path=L
        for M in moves:
            dx,dy,step=M
            if onBoard(n,x+dx,y+dy): #UL
                if board[x+dx][y+dy]==2:
                    return path+[step]
                elif board[x+dx][y+dy]==0:
                    board[x+dx][y+dy]=1
                    e=[x+dx,y+dy,path+[step]]
                    #print(e)
                    nextLeaves.append(e)
    if nextLeaves==[]:
        return "Impossible"
    else:
        #print("nextLeaves:")
        #print(nextLeaves)
        #print("board:")
        #for b in board:
        #    print(b)
        return BFS(n,board,nextLeaves)
            

def printShortestPath(n, i_start, j_start, i_end, j_end):
    board =[]
    for i in range(n):
        board.append([0]*n)
    board[i_start][j_start]=1 
    board[i_end][j_end]=2 # 2 is goal
    leaves=[[i_start, j_start,[]]]
    p=BFS(n,board,leaves)
    if p=="Impossible":
        print(p)
    else:
        print(len(p))
        print(" ".join(p))
        
    
    
    #  Print the distance along with the sequence of moves.

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)