#!/bin/python

import sys

dirArray=[["UL",-2,-1], ["UR",-2,1], ["R",0,2], ["LR",2,1], ["LL",2,-1], ["L",0,-2]]

def findWay(n,i,j,i_dest,j_dest,visit):
    if i>=n or j>=n or i<0 or j<0:
        return [0,""]
    if i==i_dest and j==j_dest:
        return [1,""]
    
    if visit[i][j]==1:
        return [0,""]
    visit[i][j]=1
    tmp=[100000,"",""]
    flag=False
    for dr in dirArray:
        curStat=findWay(n,i+dr[1],j+dr[2],i_dest,j_dest,visit)
        if curStat[0]!=0 and curStat[0]<tmp[0]:
            flag=True
            tmp[0]=curStat[0]
            tmp[1]=dr[0]
            tmp[2]=curStat[1]
    visit[i][j]=0
    if flag:
        return [1+tmp[0],tmp[1]+" "+tmp[2]]
    return [0,""]

def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    visit=[[0 for i in range(n)] for j in range(n)]
    ans=findWay(n, i_start, j_start, i_end, j_end,visit)
    if ans[0]>0:
        print ans[0]-1
        print ans[1].strip()
    else:
        print "Impossible"

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)