#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int shotestpath(int is,int js,int ie,int je,int n)
{
  static int ul=0,ur=0,r=0,lr=0,ll=0,l=0,ans[10];
  if(is -2<=ie&&js -1<=je && is>=0 && js >=0){
      ul++;
      shotestpath(is-2,js-1,ie,je,n);
  }
  else if(is-2<=ie&&js +1<=je && is>=0 && js <=n-1){
      ur++;
      shotestpath(is-2,js+1,ie,je,n);
  }
  else if(is==ie&&js+2<=je && is>=0 && js <=n-1){
      r++;
      shotestpath(is,js+2,ie,je,n);
  }
  else if(is+2<=ie&&js+1<=je && is<=n-1 && js<=n-1){
      lr++;
      shotestpath(is+2,js+1,ie,je,n);
  }
  else if(is+2<=ie&&js-1<=je && is<=n-1 && js >=0){
      ll++;
      shotestpath(is+2,js-1,ie,je,n);
  }
  else if(is==ie&&js -2<=je && is>=0 && js >=0){
      ul++;
      shotestpath(is-2,js-1,ie,je,n);
  }
  else
  {
      ans[0]=-1;
      return ans;
  }
  ans[0]=ul;
  ans[1]=ur;
  ans[2]=r;
  ans[3]=lr;
  ans[4]=ll;
  ans[5]=l;
    return ans;
  
}


int main() {
   cin >> int n;
   cin>> int i1>>int j1>>int i2>> int j2;
   int ans[10];
   ans=shotestpath(i1,j1,i2,j2,n);
    if(ans[0]==-1)
        cout<<"Impossible"<<endl;
    else
    {
       for(int i=0;i<6;i++){
           if(i==0){
               for(int j=0;j<ans[i];j++)
                   cout<<"UL ";
           }
           if(i==1){
               for(int j=0;j<ans[i];j++)
                   cout<<"UR ";
           }
           if(i==2){
               for(int j=0;j<ans[i];j++)
                   cout<<"R ";
           }
           if(i==3){
               for(int j=0;j<ans[i];j++)
                   cout<<"LR ";
           }
           if(i==4){
               for(int j=0;j<ans[i];j++)
                   cout<<"LL ";
           }
           if(i==5){
               for(int j=0;j<ans[i];j++)
                   cout<<"L ";
           }
       }
    }
    
    return 0;
}