#include <bits/stdc++.h>

using namespace std;

struct pos
{
    int visited;
    long long mvs;
    vector <string> mv;
};

void findPath(int n,int x,int y,int endx,int endy,int **board,pos **brd)
{
    //cout<<x<<" "<<y<<" "<<endl;
    
    if(brd[x][y].visited==1)
        return;
   
    if(x==endx && y==endy)
    {
        brd[x][y].mvs=0;
        brd[x][y].visited=1;
        return;
    }
    
    if(board[x][y]==1)
    {
        return;
    }
    
    board[x][y]=1;
    long long curr=-1;
    long long temp;
    int tempx,tempy;
    string cmv;
    
    if(x-2>=0 && y-1>=0)
    {
        findPath(n,x-2,y-1,endx,endy,board,brd);
        if(brd[x-2][y-1].mvs!=-1)
        {
            tempx=x-2;
            tempy=y-1;
            curr=brd[x-2][y-1].mvs+1;
            cmv="UL";
        }  
    }
    
    if(x-2>=0 && y+1<=n-1)
    {
        findPath(n,x-2,y+1,endx,endy,board,brd);
        if(brd[x-2][y+1].mvs!=-1)
        {
            temp=brd[x-2][y+1].mvs+1;
            if(curr==-1 || (curr!=-1 && temp<curr))
            {
                tempx=x-2;
                tempy=y+1;
                curr=temp;
                cmv="UR";
            }
        }
    }
    
    if(y+2<=n-1)
    {
        findPath(n,x,y+2,endx,endy,board,brd);
        if(brd[x][y+2].mvs!=-1)
        {
            temp=brd[x][y+2].mvs+1;
            if(curr==-1 || (curr!=-1 && temp<curr))
            {
                tempx=x;
                tempy=y+2;
                curr=temp;
                cmv="R";
            }
        }
    }
    
    if(x+2<=n-1 && y+1<=n-1)
    {
        findPath(n,x+2,y+1,endx,endy,board,brd);
        if(brd[x+2][y+1].mvs!=-1)
        {
            temp=brd[x+2][y+1].mvs+1;
            if(curr==-1 || (curr!=-1 && temp<curr))
            {
                tempx=x+2;
                tempy=y+1;
                curr=temp;
                cmv="LR";
            }
        }
    }
    
    if(x+2<=n-1 && y-1>=0)
    {
        findPath(n,x+2,y-1,endx,endy,board,brd);
        if(brd[x+2][y-1].mvs!=-1)
        {
            temp=brd[x+2][y-1].mvs+1;
            if(curr==-1 || (curr!=-1 && temp<curr))
            {
                tempx=x+2;
                tempy=y-1;
                curr=temp;
                cmv="LL";
            }
        }
    }
    
    if(y-2>=0)
    {
        findPath(n,x,y-2,endx,endy,board,brd);
        if(brd[x][y-2].mvs!=-1)
        {
            temp=brd[x][y-2].mvs+1;
            if(curr==-1 || (curr!=-1 && temp<curr))
            {
                tempx=x;
                tempy=y-2;
                curr=temp;
                cmv="L";
            }
        }
    }
    board[x][y]=0;
    brd[x][y].visited=1;
    if(curr==-1)
    {
        brd[x][y].mvs=-1;
    }
    else
    {
        brd[x][y].mvs=brd[tempx][tempy].mvs+1;
        brd[x][y].mv=brd[tempx][tempy].mv;
        brd[x][y].mv.push_back(cmv);
    }
    return;
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    int **board;
    pos **board1;
    int i,j;
    board=(int **)calloc(n,sizeof(int *));
    for(i=0;i<n;i++)
        board[i]=(int *)calloc(n,sizeof(int));
    
    board1=(pos **)malloc(n*sizeof(pos *));
    for(i=0;i<n;i++)
    {
        board1[i]=(pos *)malloc(n*sizeof(pos));
        for(j=0;j<n;j++)
        {
            board1[i][j].mvs=-1;
            board1[i][j].visited=0;
        }
    }
    
    findPath(n,i_start,j_start,i_end,j_end,board,board1);
    
    
    /*for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            cout<<i<<" "<<j<<" "<<board1[i][j].mvs<<endl;
        }
    }*/
    
    if(board1[i_start][j_start].mvs==-1)
        cout<<"Impossible"<<endl;
    
    else
    {
        cout<<board1[i_start][j_start].mvs<<endl;
        for(long long j=board1[i_start][j_start].mv.size()-1;j>=0;j--)
            cout<<board1[i_start][j_start].mv[j]<<" ";
        cout<<endl;
    }
    
}

int main() {
    int n;
    cin >> n;
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}