#include <bits/stdc++.h>
#include <cmath>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    
    int i_sub = i_end - i_start ;
    int j_sub = j_end - j_start ;
    
    int i_temp = i_start;
    int j_temp = j_start;
    
    vector <int> results(6);
    
    int impossible=0;
    
    int move_number=0;
    
    // UL, UR, R, LR, LL, L. 
    
    vector <int> move_array(n*n);//(n);
    
    for(int atama=0;atama<(n*n);atama++){
        move_array[atama]=10;
    }
    
    vector <int> i_temp_arr(6);
    vector <int> j_temp_arr(6);
    
    int min=0;
    
    do{ 
    
    i_sub = i_end - i_start ;
    j_sub = j_end - j_start ;
    if(i_sub==0 && j_sub==0){
        impossible=2;
        cout << move_number << endl;
        for(int t=0;t<move_array.size();t++){
            
            switch(move_array[t]){
               
               case 0:
               
               cout << "LL " ;
               
               break;
           
               case 1:
               
               cout << "UR " ;
               
               break;
               
               case 2:
               
               cout << "R " ;
               
               break;
               
               case 3:
               
               cout << "LR " ;
               
               break;
               
               case 4:
               
               cout << "UL " ;
               
               break;
               
               case 5:
               
               cout << "L " ;
               
               break;
                    
                default:
                    
                    break;
                    
          
               
       }
        }
        
    }
    
    else{
    for(int i=0;i<6;i++){
        
    
        
       if(i==0){
               i_temp=i_start ;
               j_temp=j_start ;
               i_temp=i_temp+2;
               j_temp=j_temp-1;
               
               results[0]= abs(i_end-i_temp) + abs(j_end-j_temp) ;
           
           i_temp_arr[0]=i_temp;
           j_temp_arr[0]=j_temp;
              
       }
           
       if(i==1){
               i_temp=i_start ;
                j_temp=j_start ;
               i_temp=i_temp+2;
               j_temp=j_temp+1;
               
               results[1]= abs(i_end-i_temp) + abs(j_end-j_temp) ;
           
           i_temp_arr[1]=i_temp;
           j_temp_arr[1]=j_temp;
              
       }
               
       if(i==2){
               i_temp=i_start ;
                j_temp=j_start ;
               //i_temp=i_temp+2;
               j_temp=j_temp+2;
               
               results[2]= abs(i_end-i_temp) + abs(j_end-j_temp) ;
           
           i_temp_arr[2]=i_temp;
           j_temp_arr[2]=j_temp;
                
       }
               
       if(i==3){
               i_temp=i_start ;
                j_temp=j_start ;
               i_temp=i_temp-2;
               j_temp=j_temp+1;
               
               results[3]= abs(i_end-i_temp) + abs(j_end-j_temp) ;
              
           i_temp_arr[3]=i_temp;
           j_temp_arr[3]=j_temp;
       }
               
      if(i==4){
               i_temp=i_start ;
                j_temp=j_start ;
               i_temp=i_temp-2;
               j_temp=j_temp-1;
               
               results[4]= abs(i_end-i_temp) + abs(j_end-j_temp) ;
          
          i_temp_arr[4]=i_temp;
           j_temp_arr[4]=j_temp;
             
      }
               
      if(i==5){
               i_temp=i_start ;
                j_temp=j_start ;
               //i_temp=i_temp-2;
               j_temp=j_temp-2;
               
               results[5]= abs(i_end-i_temp) + abs(j_end-j_temp) ;
          
          i_temp_arr[5]=i_temp;
           j_temp_arr[5]=j_temp;
            
      }   
               
               
       }
        
        min=results[0];
        int move=0;
        
        for(int j=1;j<6;j++){
            if(min>results[j]){
                min=results[j];
                move = j;
                
                    i_start = i_temp_arr[j];
                    j_start = j_temp_arr[j];
                
            }
            
            else if(min==results[j]){
                
                if(move<j){
                    
                }
                else{
                min=results[j];
                move = j; 
                    
                    i_start = i_temp_arr[j];
                    j_start = j_temp_arr[j];
                    
                }
                
            }
        }
        //cout << move << endl;
        
        
       
        
        
        
        if(i_start>n-1 || i_start<0 ||j_start>n || j_start<0){
            impossible=1;
        }
        
        move_array[move_number]=move;
        
        move_number++;
        
        
    }
        
     }while(impossible==0);
    
    if(impossible==1){
        cout << "Impossible" << endl;
    }

    
    
}

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