#include <bits/stdc++.h>
#define mk make_pair
#define pb push
using namespace std;
int v[201][201]={};
queue<pair<int,int> > q;
map< pair<int,int> ,pair< int,int> > p;
int sx,sy,ex,ey,n,f=0,pi,pj,c=0;
string ans="";
    void bfs(int i,int j){
       // cout<<i<<" "<<j<<"*";
        if(i==ex&&j==ey){f=1; while(!q.empty())q.pop(); }
        else{
if((i-1)>=0&&(j-2)>=0&&(i-1)<=n-1&&(j-2)<=n-1&&!v[i-1][j-2]){ v[i-1][j-2]=1;q.pb(mk(i-1,j-2));p[mk(i-1,j-2)]=mk(i,j); }
if((i+1)>=0&&(j-2)>=0&&(i+1)<=n-1&&(j-2)<=n-1&&!v[i+1][j-2]){ v[i+1][j-2]=1;q.pb(mk(i+1,j-2));p[mk(i+1,j-2)]=mk(i,j); } if((i+2)>=0&&(j+0)>=0&&(i+2)<=n-1&&(j+0)<=n-1&&!v[i+2][j+0]){ v[i+2][j+0]=1;q.pb(mk(i+2,j+0));p[mk(i+2,j+0)]=mk(i,j); } if((i+1)>=0&&(j+2)>=0&&(i+1)<=n-1&&(j+2)<=n-1&&!v[i+1][j+2]){ v[i+1][j+2]=1;q.pb(mk(i+1,j+2));p[mk(i+1,j+2)]=mk(i,j); } if((i-1)>=0&&(j+2)>=0&&(i-1)<=n-1&&(j+2)<=n-1&&!v[i-1][j+2]){ v[i-1][j+2]=1;q.pb(mk(i-1,j+2));p[mk(i-1,j+2)]=mk(i,j); } if((i-2)>=0&&(j+0)>=0&&(i-2)<=n-1&&(j+0)<=n-1&&!v[i-2][j+0]){ v[i-2][j+0]=1;q.pb(mk(i-2,j+0));p[mk(i-2,j+0)]=mk(i,j); } }
        if(!q.empty()){
     i=q.front().first;j= q.front().second; q.pop();     bfs(i,j);
        }
    }
int main() {int i,j;
cin>>n;
            cin>>sy>>sx>>ey>>ex;
    bfs(sx,sy);
    if(f){i=ex;j=ey;
        while(1){
            c++;
         pi=p[mk(i,j)].first; pj=p[mk(i,j)].second;
            if( (i-pi)==-1&&(j-pj)==-2 ){ans="UL "+ans;}
            else if( (i-pi)==1&&(j-pj)==-2 ){ans="UR "+ans;}
            else if( (i-pi)==2&&(j-pj)==0 ){ans="R "+ans;}
            else if( (i-pi)==1&&(j-pj)==2 ){ans="LR "+ans;}
            else if( (i-pi)==-1&&(j-pj)==2 ){ans="LL "+ans;}
            else if( (i-pi)==-2&&(j-pj)==0 ){ans="L "+ans;}
      i=pi;j=pj;   //cout<<"^"<<i<<" "<<j<<"&";
        if(i==sx&&j==sy)break;}
          cout<<c<<"\n"<<ans;
    }
    else cout<<"Impossible";
    return 0;
}