#include <bits/stdc++.h>

using namespace std;
int cd[]={-1,1,2,1,-1,-2};
int ab[]={-2,-2,0,2,2,0};

string sp[]={"UL","UR","R","LR","LL","L"};
int m,flag=0;
 vector < pair<int,string> > v;
int check(int x,int y)
{
  if(x<0||x>=m||y<0||y>=m)
    return 0;
  return 1;
}
int fin(int n,int x,int y,int p, int q)
{
    int dir=0;
    if(q==y&&(int)abs(x-p)==1)
        dir=-2;
    else if(x==p)
    {
        if(q>y&&((q-y)%2==0))
            dir=2;
        else  if(q>y&&(q-y)%2!=0)
            dir=-2;
        else if(q<y&&(q-y)%2==0)
            dir=5;
        else if(q<y&&(q-y)%2!=0)
            dir=-2;
        else
            dir=2;
    }
    else  
    {
       
         if(x>=p&&y>=q)
            dir=0;
        else  if(x>=p&&y<=q)
            dir=1;
        else if(x<=p&&y<=q)
            dir=3;
        else
            dir=4;
            
          
            
    }
    return dir;
}
void abc(int n,int x,int y,int p, int q,int *dir )
{
    //cout<<x<<" "<<y<<"\n";
    if(*dir==-2||flag==1)
        return;
    if(x==p&&y==q)
    {  v.push_back(make_pair(*dir,sp[*dir]));
        flag=1;
        return;
    }
    if(*dir==-1)
    {
       
    }
    else
    {
       v.push_back(make_pair(*dir,sp[*dir]));
    }
    *dir=fin(n,x,y,p,q);
    if(*dir==-2)
        return;
     if(check(x+ab[*dir],y+cd[*dir]))
         abc(n,x+ab[*dir],y+cd[*dir],p,q,dir);
     else
     {*dir=-2;
      return;
     }
}

 

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end)
{
   
    int dir =-1;
    m=n;
     abc(n, i_start, j_start, i_end, j_end,&dir);
   //cout<<dir<<"\n";
    if(dir==-2)
        cout<<"Impossible";
    else
    {cout<<v.size()<<"\n";
     sort(v.begin(),v.end());
    for(int i=0;i<v.size();i++)
        cout<<v[i].second<<" ";
    }
   
}

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;
}