#include <bits/stdc++.h>

using namespace std;
#define N 200
int is_safe(int n,int x, int y, int sol[][N]){
    if(x>=0 && x<n && y>=0 && y<n && sol[x][y]==0)
        return 1;
    return 0;
}
void print_util(int i){
    switch(i){
        case 0 : cout<<"UL ";
                 break;
        case 1 : cout<<"UR ";
                 break;
        case 2 : cout<<"R ";
                 break;
        case 3 : cout<<"LR ";
                 break;
        case 4 : cout<<"LL ";
                 break;
        case 5 : cout<<"L ";
                 break;
    }
}
void print_order(stack<int> order){
    vector<int> temp;
    cout<<order.size()<<endl;
    while(!order.empty()){
        temp.push_back(order.top());
        order.pop();
    }
    for(int i=temp.size()-1;i>=0;i--)
       print_util(temp[i]);
    cout<<endl;
}
bool printShortestPath(int n, int i_start, int j_start, int i_end, int j_end,stack<int> order,int sol[][N]) {
    //  Print the distance along with the sequence of moves.
    int x_dir[6] = {-2,-2,0,+2,+2,0};
    int y_dir[6] = {-1,+1,+2,+1,-1,-2};
    if((i_start==i_end)&&(j_start==j_end)){
        print_order(order);
       // cout<<"hey"<<endl;
        return true;
    }
       int n_x,n_y;
    
    for(int i=0;i<6;i++){
       // i_start += x_dir[i];
       // j_start += y_dir[i];
        n_x = i_start+x_dir[i];
        n_y = j_start+y_dir[i];
        if(is_safe(n,n_x,n_y,sol)){
            order.push(i);
            sol[n_x][n_y] = 1;
           // cout<<i<<endl;
         if(printShortestPath(n,n_x,n_y,i_end,j_end,order,sol))
             return true;
         else{
          order.pop();  
          sol[n_x][n_y] = 0;
         }
        }
       
    }
    return false;
        
    
}

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;
    stack<int> order;
    int sol[N][N] = {0};
    //c=n;
   if (!printShortestPath(n, i_start, j_start, i_end, j_end,order,sol))
       cout<<"Impossible"<<endl;
    return 0;
}