#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int I, int J, int I1, int J1) 
{
    int a[n][n];
    int i,j; int f=0;
   
       if((I+I1)%2!=0) f=1;
       if((I1-I)%4==0 || (I-I1)%4==0 ) 
       {
           if((J+J1)%2!=0) f=1;
       }
     else
     {
         if((J+J1)%2==0) f=1;
     } 
   if(f==1) { cout<<"Impossible"; return; }
    
    I=I/2; I1=I1/2;
    i=I;  j=J;
    
  //  cout<<I1<<"    "<<I<<endl;
   // cout<<J1<<"    "<<J<<endl;
    int c=0;
   if(I1<I)
   {
       int y=I-I1;
       int x=abs(J1-J);
       if(y==x)
       {  cout<<y<<endl;
           if(J1>J) while(y--) { cout<<"UR ";   }
           else while(y--) { cout<<"UL ";      }
       }
     else if(x<y)
       {
            cout<<y<<endl;
           int u=((I+J)-(I1+J1))/2;
           while(u--) { cout<<"UL "; y--;  }
           while(y--) { cout<<"UR ";   }
       }
       else
       {
           cout<<(x-y)/2+y<<endl;
           if(J1<J)
           {
             while(y--) { cout<<"UL "; x--;   }
              while(x)  { cout<<"L ";  x=x-2; }
           }
           else
           {
               while(y--) { cout<<"UR "; x--; }
               while(x) { cout<<"R "; x=x-2; }
           }
           
           
       }
       
   }
    if(I1>I)
   {
       int y=I1-I;
       int x=abs(J1-J);
       if(y==x)
       {  cout<<y<<endl;
           if(J1>J) while(y--) cout<<"LR ";
           else while(y--) cout<<"LL ";
       }
      else if(x<y)
       {  cout<<y<<endl;
           int u=((I1+J1)-(I+J))/2;
           while(u--) { cout<<"LR "; y--; }
           while(y--) { cout<<"LL ";  }
       }
        else
       {
           cout<<(x-y)/2+y<<endl;
           if(J1<J)
           {
             while(y--) { cout<<"LL "; x--;   }
              while(x) { cout<<"L ";   x=x-2; } 
           }
           else
           {  
               x=x-y;
               while(x) { cout<<"R "; x=x-2; }
               while(y--) { cout<<"LR ";  }
              
           }
           
           
       }
       
       
   }
    if(I1==I)
    { 
        int x=abs(J1-j); x=x/2; 
        cout<<x<<endl;
        if(J1>J) while(x--) cout<<"R ";
        else while(x--) cout<<"L ";
    }
    
  
    
}

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