#include <bits/stdc++.h>

using namespace std;

#define mx  10001
int i_start;
int j_start;
int i_end;
int j_end;
int grid[301][301];
bool pathGrid[301][301];

void visitGrid(int n,int start,int end,int cost){
    if(start<0 || start>n || end<0 || end>n){
        return;
    }
    int mn = min(cost,grid[start][end]);
    if(mn<grid[start][end]){
      grid[start][end] = mn;
      if(start == i_end && end == j_end){
          pathGrid[start][end] = true;
      } 
    }
    else{
        return;
    }
   // cout<<start<<" "<<end<<" "<<grid[start][end]<<endl;
    
    if((start-2>=0 && start-2<n) && (end-1>=0 && end-1<n )){//UL
        visitGrid(n,start-2,end-1,cost+1);
        if(pathGrid[start-2][end-1]){
            pathGrid[start][end] = true;
        }
    }
    if((start-2>=0 && start-2<n) && (end+1>=0 && end+1<n )){//UR
        visitGrid(n,start-2,end+1,cost+1);
         if(pathGrid[start-2][end+1]){
            pathGrid[start][end] = true;
        }
    }
     if(end+2>=0 && end+2<n){//R
        visitGrid(n,start,end+2,cost+1);
        if(pathGrid[start][end+2]){
            pathGrid[start][end] = true;
        }
    }
    if((start+2>=0 && start+2<n) && (end+1>=0 && end+1<n )){//LR
        visitGrid(n,start+2,end+1,cost+1);
        if(pathGrid[start+2][end+1]){
            pathGrid[start][end] = true;
        }
    }
    if((start+2>=0 && start+2<n) && (end-1>=0 && end-1<n )){//LL
        visitGrid(n,start+2,end-1,cost+1);
        if(pathGrid[start+2][end-1]){
            pathGrid[start][end] = true;
        }
    }
    if(end-2>=0 && end-2<n){ //L
        visitGrid(n,start,end-2,cost+1);
        if(pathGrid[start][end-2]){
            pathGrid[start][end] = true;
        }
    }
}

bool reached = false;

vector<string>ans;

void printGrid(int start,int end,int x,int y,int cost,int n){
   if(start==x && end==y){
       reached = true;
       return;
   }
   if(!pathGrid[start][end] || reached){
       return;
   }           
   if((end+2>=0 && end+2<n) && pathGrid[start][end+2] && grid[start][end+2]== cost-1){
      ans.push_back("L");
      printGrid(start,end+2,x,y,cost-1,n); 
   }
   else if((start-2>=0 && start-2<n) && (end+1>=0 && end+1<n )&&pathGrid[start-2][end+1] && grid[start-2][end+1]==cost-1){
      ans.push_back("LL");
      printGrid(start-2,end+1,x,y,cost-1,n); 
   }
   else if((start-2>=0 && start-2<n) && (end-1>=0 && end-1<n )&&pathGrid[start-2][end-1] && grid[start-2][end-1]==cost-1)
   {
      ans.push_back("LR");
      //ans+="LR ";
      printGrid(start-2,end-1,x,y,cost-1,n); 
   }
   else if((end-2>=0 && end-2<n ) && pathGrid[start][end-2] && grid[start][end-2]==cost-1){
        ans.push_back("R");
       //ans+="R ";
      printGrid(start,end-2,x,y,cost-1,n); 
   } 
   else if((start+2>=0 && start+2<n) && (end-1>=0 && end-1<n )&&pathGrid[start+2][end-1] && grid[start+2][end-1]==cost-1)
   {
       ans.push_back("UR");  
      //ans+="UR ";
      printGrid(start+2,end-1,x,y,cost-1,n); 
   }
   else if((start+2>=0 && start+2<n) && (end+1>=0 && end+1<n )&&pathGrid[start+2][end+1] && grid[start+2][end+1]==cost-1){
        ans.push_back("UL");
       //ans+="UL ";
      printGrid(start+2,end+1,x,y,cost-1,n); 
   }
            
   else{
       return;
   } 
}

void displayGrid(int n){
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            cout<<grid[i][j]<<" "; 
        }
        cout<<endl;
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            cout<<pathGrid[i][j]<<" "; 
        }
        cout<<endl;
    }
}

void printSolution(int p,int q,int x,int y,int n){
    if(grid[x][y]==10001){
        cout<<"Impossible"<<endl;
        return;
    }
    else{
        cout<<grid[x][y]<<endl;
        printGrid(x,y,p,q,grid[x][y],n);
       // displayGrid(n);
        for(int i=ans.size()-1;i>=0;i--){
            cout<<ans[i]<<" ";
        }
    }
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    visitGrid(n,i_start,j_start,0);
    printSolution(i_start,j_start,i_end,j_end,n);
}

int main() {
    int n;
    reached = false;
    //ans="";
    cin >> n;
    cin >> i_start >> j_start >> i_end >> j_end;
     for(int i=0;i<=300;i++){
        for(int j=0;j<=300;j++){
            grid[i][j] = mx;
            pathGrid[i][j] = false;
        }
    }
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}