#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    if(i_start>i_end && j_start<j_end){
      if((i_start-i_end)%2==0){
          int a = (i_start-i_end)/2;
          j_start = j_start + a;
          if((j_end - j_start)%2==0){
              int b = (j_end - j_start)/2;
              cout<<a+b<<endl;
              for(int i=0;i<a;i++){cout<<"UR ";}
              for(int i=0;i<b;i++){cout<<"R ";}
          }else{cout<<"Impossible";}
      }else{cout<<"Impossible";}
        
    }
    else if(i_start>i_end && j_start>j_end){
      if((i_start-i_end)%2==0){
          int a = (i_start - i_end)/2;      
          j_start = j_start -a ;
          if((j_start - j_end)%2==0){
              int b = (j_start - j_end)/2;
              cout<<a+b<<endl;
              for(int i=0;i<a;i++){cout<<"UL ";}
              for(int i=0;i<b;i++){cout<<"L ";}
          }else{cout<<"Impossible";}
      }else{cout<<"Impossible";}
        
        
    }
    else if(i_start<i_end && j_start>j_end){
      if((i_end-i_start)%2==0){
         int a = (i_end-i_start)/2;
         j_start = j_start -a;
         if((j_start-j_end)%2==0){
             int b = (j_start-j_end)/2;
             cout<<a+b<<endl;
             for(int i=0;i<a;i++){cout<<"LL ";}
             for(int i=0;i<b;i++){cout<<"L ";}
         }else{cout<<"Impossible";} 
          
      }else{cout<<"Impossible";}
        
    }
    else if(i_start<i_end && j_start<j_end){
       if((i_end-i_start)%2==0){
          int a = (i_end - i_start)/2;
          j_start = j_start +a;
          if((j_end-j_start)%2==0){
              int b = (j_end-j_start)/2;
              cout<<a+b<<endl;
              for(int i=0;i<b;i++){cout<<"R ";}
              for(int i=0;i<a;i++){cout<<"LR ";}
          }else{cout<<"Impossible";}
      }else{cout<<"Impossible";}
        
        
    }
    //........................................................
    else if(i_start == i_end){
        if((j_start-j_end)%2==0){
            if(j_start>j_end){
                int a = (j_start - j_end)/2;
                cout<<a<<endl;
                for(int i=0;i<a;i++){cout<<"R ";}
            }else{
                int a = (j_end - j_start)/2;
                cout<<a;
                for(int i=0;i<a;i++){cout<<"L ";}
            }
        }else{cout<<"Impossible";}        
    }
  //................................................................  
    else if(j_start == j_end){
        if((i_start-i_end)%4==0){
            if(i_start>i_end){
              int a = (i_start - i_end)/4;
              cout<<2*a<<endl;
              for(int i=0;i<a;i++){
                  cout<<"UL UR ";
              }  
            }else{
              int a = (i_end - i_start)/4;
              cout<<2*a<<endl;
              for(int i=0;i<a;i++){
                  cout<<"LR LL ";
              }                
            }            
        }else{cout<<"Impossible";}
        
    }
}

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