#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    if((i_start%2==0 && i_end%2!=0) || (i_start%2!=0 && i_end%2==0))
    {
        cout<<"Impossible";
        return;
    }
    int p=i_start;
        int q=j_start;
        int r=i_end;
        int s=j_end;
    int count=0;
    while(p!=r && q!=s)
    {
        int flag1=0,flag2=0;
        if(p-2>=0 && q-1>=0 && p>r)
        {
            p=p-2;
            q=q-1;
            cout<<"UL"<<" ";
            flag1=1;
            count++;
          
        }
         if (p-2>=0 && q+1>=0 && p>r )
        {
             if(flag1==0)
             {
           p=p-2;
            q=q-1;
            cout<<"UR"<<" ";
                 flag1==1;
                 count++;
             }
             
        }
        if(q+2<n && flag1==0 )
        {
            q=q+2;
            flag2=1;
            cout<<"R"<<" ";
            count++;
        }
        if ( p<r && p+2<n && q+1<n)
        {
            p=p+2;
            q=q+1;
            flag2=1;
            cout<<"LR"<<" ";
            count++;
        }
        if( p<r &&p+2<n && q-1>=0)
        {
            if(flag2==0)
            {
            p=p+2;
            q=q-1;
            cout<<"LL"<<" ";
            flag2=1;
            count++;
            }
            
        }
       else if(flag1==0 && q+2<n )
        {
           if(flag2==0)
           {
            q=q-2;
            cout<<"L"<<" ";
        count++;
        }
       }
        
        
    }
    
    
}

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