#include<bits/stdc++.h>
using namespace std;
int rd[6]={-2,-2,0,0,2,2};
int cd[6]={-1,1,-2,2,-1,1};
string dir[6]={"UL","UR","L","R","LL","LR"};
string Path[201][201];
int MinPath[201][201];
bool Visited[201][201]={0};
/*bool isPossible(int n,int r,int c,int r_end,int c_end)
{
    if(Visited[r][c])
    {
        return false;
    }
    return true;
}*/
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end)
{
    //cout<<i_start<<" "<<j_start<<endl;
    if(Visited[i_start][j_start])
    {
        return;
    }
    if(i_start==i_end && j_start==j_end)
    {
        Visited[i_start][j_start]=1;
        return;
    }
    /*if(Visited[i_start][j_start])
    {
        return;
    }*/
    if(MinPath[i_start][j_start]!=INT_MAX)
    {
        return;
    }
    Visited[i_start][j_start]=1;
    for(int i=0;i<6;i++)
    {
        int r=i_start+rd[i];
        int c=j_start+cd[i];
        if(r>=0 && c>=0 && r<n && c<n)
        {
            //if(Visited[r][c]==0)
            //{
                printShortestPath(n,r,c,i_end,j_end);
                if(MinPath[r][c]==INT_MAX)
                {
                    continue;
                }
                else if((1+MinPath[r][c])<MinPath[i_start][j_start])
                {
                    MinPath[i_start][j_start]=1+MinPath[r][c];
                    Path[i_start][j_start]=dir[i]+" "+Path[r][c];
                }
            //}
            //else
            //{
              //  return;
            //}
        }
    }
    return;
}

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;
    for(int i=0;i<201;i++)
    {
        for(int j=0;j<201;j++)
        {
            MinPath[i][j]=INT_MAX;
        }
    }
    MinPath[i_end][j_end]=0;
    //Visited[i_end][j_end]=1;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    if(Visited[i_end][j_end]==0)
    {
        cout<<"Impossible\n";
        return 0;
    }
    cout<<MinPath[i_start][j_start]<<endl;
    cout<<Path[i_start][j_start];
    return 0;
}