#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

enum steps 
{UL,LL,UR,LR,R,L};

struct path
{
    int no_of_steps;
   vector<steps> s;
    vector<int> i;
    vector<int> j;
    
    path()
    {
        no_of_steps=0;
    }
} ;

vector<path> p;

int n,si,sj,ei,ej;

void rec(int si,int sj,int ei,int ej, path experimental);

void funcUL(int si,int sj,int ei,int ej,path experimental)
{   experimental.no_of_steps++;
        if(experimental.no_of_steps>n)
        return;
    int tempi,tempj;
    tempi=si-2;
    tempj=sj-1;
    if((tempi>=0)&&(tempj>=0))
    {   experimental.i.push_back(si);
        experimental.j.push_back(sj);
        si=tempi;
        sj=tempj;
        experimental.s.push_back(UL);
    }
    else return;
    if((si==ei)&&(sj==ej))
        p.push_back(experimental);
     else 
        rec(si,sj,ei,ej,experimental);
    
}

void funcLL(int si,int sj,int ei,int ej,path experimental)
{   experimental.no_of_steps++;
    if(experimental.no_of_steps>n)
        return;
    int tempi,tempj;
    tempi=si+2;
    tempj=sj-1;
    if((tempi<n)&&(tempj>=0))
    {   experimental.i.push_back(si);
        experimental.j.push_back(sj);
        si=tempi;
        sj=tempj;
        experimental.s.push_back(LL);
    }
    else return;
    if((si==ei)&&(sj==ej))
        p.push_back(experimental);
     else 
        rec(si,sj,ei,ej,experimental);
    
}

void funcUR(int si,int sj,int ei,int ej,path experimental)
{   experimental.no_of_steps++;
  // if((si==ei)&&(sj+1==ej)) 
  //     cout<<"  "<<sj;
     if(experimental.no_of_steps>n)
        return;
    int tempi,tempj;
    tempi=si-2;
    tempj=sj+1;
    if((tempi>=0)&&(tempj<n))
    {   experimental.i.push_back(si);
        experimental.j.push_back(sj);
        si=tempi;
        sj=tempj;
        experimental.s.push_back(UR);
    }
    else return;
    if((si==ei)&&(sj==ej))
    {p.push_back(experimental);
     
    }
     else 
        rec(si,sj,ei,ej,experimental);
    
}

void funcLR(int si,int sj,int ei,int ej,path experimental)
{   experimental.no_of_steps++;
     if(experimental.no_of_steps>n)
        return;
    int tempi,tempj;
    tempi=si+2;
    tempj=sj+1;
    if((tempi<n)&&(tempj<n))
    {   experimental.i.push_back(si);
        experimental.j.push_back(sj);
        si=tempi;
        sj=tempj;
        experimental.s.push_back(LR);
    }
    else return;
    if((si==ei)&&(sj==ej))
        p.push_back(experimental);
     else 
        rec(si,sj,ei,ej,experimental);
    
}

void funcL(int si,int sj,int ei,int ej,path experimental)
{   experimental.no_of_steps++;
     if(experimental.no_of_steps>n)
        return;
    int tempj;
    tempj=sj-2;
    if(tempj>=0)
    {   experimental.i.push_back(si);
        experimental.j.push_back(sj);
        sj=tempj;
        experimental.s.push_back(L);
    }
    else return;
    if((si==ei)&&(sj==ej))
        p.push_back(experimental);
    else 
        rec(si,sj,ei,ej,experimental);
    
}

void funcR(int si,int sj,int ei,int ej,path experimental)
{   experimental.no_of_steps++;
     if(experimental.no_of_steps>n)
        return;
    int tempj;
    tempj=sj+2;
    if(tempj<n)
    {   experimental.i.push_back(si);
        experimental.j.push_back(sj);
        sj=tempj;
        experimental.s.push_back(R);
    }
    else return;
    if((si==ei)&&(sj==ej))
        p.push_back(experimental);
    else 
        rec(si,sj,ei,ej,experimental);
    
}

void rec(int si,int sj,int ei,int ej, path experimental)
{   if((ei<=si)&&(ej>=sj))
    funcUR(si,sj,ei,ej,experimental);
    if((ei>=si)&&(ej>=sj))
    funcLR(si,sj,ei,ej,experimental);
    if((ei<=si)&&(ej<=sj))
    funcUL(si,sj,ei,ej,experimental);
    if((ei>=si)&&(ej<=sj))
    funcLL(si,sj,ei,ej,experimental);
    if(ej>=sj)
    funcR(si,sj,ei,ej,experimental);
    if(ej<=sj)
    funcL(si,sj,ei,ej,experimental);

    
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    
    int si,sj,ei,ej;
    cin>>n>>si>>sj>>ei>>ej;
    path ex;
    rec(si,sj,ei,ej,ex);
    if(p.size()==0)
        cout<<"Impossible";
    else
    {   path lowest=p[0];
       // cout<<"\n"<<p.size();
        for(int i=1;i<p.size();i++)
        {
            if(p[i].no_of_steps<lowest.no_of_steps)
                lowest=p[i];
        }
        cout<<lowest.no_of_steps<<endl;
     for(int i=0;i<lowest.s.size();i++)
     { // cout<<" "<<lowest.i[i]<<" "<<lowest.j[i];
         switch(lowest.s[i])
         {
             case 0: cout<<"UL"; break;
             case 1: cout<<"LL";break;
             case 2: cout<<"UR";break;
             case 3: cout<<"LR";break;
             case 4: cout<<"R";break;
             case 5: cout<<"L";break;
         }
         cout<<" ";
     }
    }
    return 0;
}