#include<bits/stdc++.h>
using namespace std;
int moves[6];
int path[20000];
int mindist=-1;
int  vis[50000];
int dist[50000];
int parent[50000];
void bfs(int n, int source,int dest,int dis,int pat[])
{
    int y=source%n;
    int x=source/n;
    //cout<<source<<":"<<dis<<endl;
    //cout<<x<<","<<y<<"::"<<dis<<endl;
    //cout<<"::"<<dist[source]<<endl;
    if(source==dest)
    {
        //cout<<dis<<"::\n";
        //cout<<x<<":"<<y<<endl;
        if(dis<mindist || mindist==-1)
        {
            mindist=dis;
            for(int i=0;i<dis;i++)
              path[i]=pat[i];
            return;
        }
    }
    if(!vis[source] && x>=0 && y>=0 && x<n && y<n){
      vis[source]=1;
    for(int i=0;i<6;i++)
    {
        pat[dis]=i;
        if(i==0 && x>1 && y>0){
            if((dis+1)<dist[source+moves[i]])
            {
                dist[source+moves[i]]=dist[source]+1;
                parent[source+moves[i]]=source;
                bfs(n, source+moves[i],dest, dis+1,pat);
            }
        }
        else if(i==1 && y<(n-1) && x>1)
          {
            if((dis+1)<dist[source+moves[i]])
            {
                dist[source+moves[i]]=dist[source]+1;
                parent[source+moves[i]]=source;
                bfs(n, source+moves[i],dest, dis+1,pat);
            }
            }
        else if(i==2 && y<(n-2))
          {
            if((dis+1)<dist[source+moves[i]])
            {
                dist[source+moves[i]]=dist[source]+1;
                parent[source+moves[i]]=source;
                bfs(n, source+moves[i],dest, dis+1,pat);
            }
            }
        else if(i==3 && y<(n-1) && x<(n-2))
          {
            if((dis+1)<dist[source+moves[i]])
            {
                dist[source+moves[i]]=dist[source]+1;
                parent[source+moves[i]]=source;
                bfs(n, source+moves[i],dest, dis+1,pat);
            }
            }
        else if(i==4 && y>0 && x<(n-2))
          {
            if((dis+1)<dist[source+moves[i]])
            {
                dist[source+moves[i]]=dist[source]+1;
                parent[source+moves[i]]=source;
                bfs(n, source+moves[i],dest, dis+1,pat);
            }
            }
        else if(i==5 && y>1)
          {
            if((dis+1)<dist[source+moves[i]])
            {
                dist[source+moves[i]]=dist[source]+1;
                parent[source+moves[i]]=source;
                bfs(n, source+moves[i],dest, dis+1,pat);
            }
            }
    }
    vis[source]=0;
    }
}

int main()
{
    int n;
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n;
    //cout<<n<<":";
    moves[0]=-2*n-1;
    moves[1]=-2*n+1;
    moves[2]=2;
    moves[3]=2*n+1;
    moves[4]=2*n-1;
    moves[5]=-2;
    int is,js,ie,je;
    cin>>is>>js>>ie>>je;
    int s=is*n+js;
    int d=ie*n+je;
    //for(int i=0;i<8;i++) {for(int j=0;j<8;j++) cout<<(8*i+j)<<" "; cout<<endl;}
    int pat[20000];
    //cout<<"A:";
    memset(vis,0,sizeof(vis));
    for(int i=0;i<(n*n);i++) dist[i]=99999;
    dist[s]=0;
    bfs(n,s,d,0,pat);
    int ans=mindist;
    //cout<<dist[d]<<endl;
    if(ans==-1) cout<<"Impossible";
    else
    {
        cout<<ans<<endl;
        if(ans!=0)
        for(int i=0;i<ans;i++)
        {
            if(path[i]==0) cout<<"UL ";
            else if(path[i]==1) cout<<"UR ";
            else if(path[i]==2) cout<<"R ";
            else if(path[i]==3) cout<<"LR ";
            else if(path[i]==4) cout<<"LL ";
            else if(path[i]==5) cout<<"L ";
        }
    }
}