#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i1, int j1, int i2, int j2) {
    int n1,n2,nr,nd,ns,c;
    n1=abs(j2-j1);
    n2=abs(i2-i1);
    nr=abs(n1-n2/2)/2;
    nd=n2/2;
    ns=nr+nd;
    if((n2%2)!=0)
    {cout<<"Impossible";return;}
    if(n1>n2/2)
    {
    if(j1<=j2)
    {
        if(i1<=i2)
        {
        if(j2==(j1+2*nr+nd))
        {
            cout<<ns<<endl;
          for(int i=0;i<nr;i++)
                cout<<"R ";
            for(int i=0;i<nd;i++)
                    cout<<"LR "; 
            
                  
        }
        else
        {cout<<"Impossible";return;}
        }
        else
        {
            if(j1==(j2+2*nr+nd))
        {
            cout<<ns<<endl;
          for(int i=0;i<nd;i++)
                    cout<<"UR ";  
            for(int i=0;i<nr;i++)
                cout<<"R ";
                 
        }
        else
        {cout<<"Impossible";return;}
        }
        }
    else
    {
        if(i1<=i2)
        {
        if(j2==(j1+2*nr+nd))
        {
            cout<<ns<<endl;
          for(int i=0;i<nd;i++)
                    cout<<"LL ";   
            for(int i=0;i<nr;i++)
                cout<<"L ";
                
        }
        else
        {cout<<"Impossible";return;}
        }
        else
        {
            if(j1==(j2+2*nr+nd))
        {
            cout<<ns<<endl;
          for(int i=0;i<nd;i++)
                    cout<<"UL ";   
            for(int i=0;i<nr;i++)
                cout<<"L ";
                
        }
        else
        {cout<<"Impossible";return;}
        }
        }
    }
    else
    {
        if((nd-n1)%2==0)
        {
           cout<<nd<<endl;
            c=(nd-n1)/2;
            if(i1<=i2)
           {
               if(j1<=j2)
               {
                   if(c==0)
                   {
                       for(int i=0;i<nd;i++)
                           cout<<"LR ";
                   } 
                   else
                   {
                       for(int i=0;i<n1;i++)
                           cout<<"LR ";
                       for(int i=0;i<c;i++)
                           cout<<"LR LL ";
                   }
                   
               }
                else
                {
                    if(c==0)
                   {
                       for(int i=0;i<nd;i++)
                           cout<<"LL ";
                   } 
                   else
                   {
                       for(int i=0;i<n1;i++)
                           cout<<"LL ";
                       for(int i=0;i<c;i++)
                           cout<<"LR LL ";
                   }
                }
           }
            else
            {
                if(j1<=j2)
               {
                   if(c==0)
                   {
                       for(int i=0;i<nd;i++)
                           cout<<"UR ";
                   } 
                   else
                   {
                       for(int i=0;i<n1;i++)
                           cout<<"UR ";
                       for(int i=0;i<c;i++)
                           cout<<"UL UR ";
                   }
                   
               }
                else
                {
                    if(c==0)
                   {
                       for(int i=0;i<nd;i++)
                           cout<<"UL ";
                   } 
                   else
                   {
                       for(int i=0;i<n1;i++)
                           cout<<"UL ";
                       for(int i=0;i<c;i++)
                           cout<<"UL UR ";
                   }
                }
            }
        }
        else
        {
            cout<<"Impossible";return;
        }
            
    }
}

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