#include <bits/stdc++.h>

using namespace std;
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end);
 
    


void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end, int sz) {
    int i=i_start,j=j_start;
    if(sz==0){
    if(abs(((i_end)-(i_start))+2)%2!=0)
    {
        cout<<"Impossible";
        return;
    }}
    for (int h=0;h<2*n;h++){
    if(i==i_end && j==j_end)
    {
            cout<<sz;
        
        return;
    }
        else if(j-j_end==0 && i_end>i)
    {
        
        i=i+2;
        j=j-1;cout<<" LL ";
            sz++;
        
             i=i+2;
        j=j+1;cout<<" LR ";
    }
    else if(j-j_end==0 && i_end<i)
    {
        i=i-2;
        j=j-1;
       cout<<" UL ";
        sz++;
        
          i=i-2;
        j=j+1;cout<<" UR ";
 
    }
    
    else if(i_end-i==0 && j_end<j)
    {
        
            
        j=j-2;cout<<" L ";
       
    }
    else if(i_end-i==0 && j_end>j)
    { 
        j=j+2;cout<<" R ";
        }
    else if(i_end>i && j_end<j)
    {
        i=i+2;
        j=j-1;cout<<" LL ";
    }
    else if(i_end>i && j_end>j)
    { i=i+2;
        j=j+1;cout<<" LR ";}
    else if(i_end<i && j_end<j)
    {
        i=i-2;
        j=j-1;
       cout<<" UL ";
}
    else if(i_end<i && j_end>j)
    {i=i-2;
        j=j+1;cout<<" UR ";
 }
    
    sz++;
}}


int main() {
    int n,p=0;
    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,p);
    return 0;
}