#include <bits/stdc++.h>

using namespace std;


void strprin(char *s,int n)
{
    for(int i=0;i<n;i++)
        cout<<s<<" ";
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
        if(abs(i_start-i_end)%2==0)
        {       int x=abs(j_start-j_end);
                int y=abs(i_start-i_end);
                if(y%4==0&&x%2!=0)
                {
                    cout<<"Impossible";
                    return;
                    
                } 
                if(y%4!=0&&x%2==0)
                {cout<<"Impossible";
                return;}
            
            
                if(y==2*x)
                {  
                   cout<<x;
                   if(i_start>i_end&&j_start>j_end)
                          strprin("UL",x);
                   else if(j_start>j_end&&i_start<i_end)
                          strprin("LL",x);
                   else if(j_start<j_end&&i_start>i_end)
                          strprin("UR",x);
                    else 
                          strprin("LR",x);
                    return;
               }
               else if(y>2*x)
               {
                       int z=(y-(2*x))/2;
                    cout<<x+z<<endl;
                    if(i_start>i_end&&j_start>j_end)
                    {
                        strprin("UL",x+z/2);
                        strprin("UR",z/2);
                        
                    }
                   else if(j_start>j_end&&i_start<i_end)
                   {
                       strprin("LR",z/2);
                       strprin("LL",x+z/2);
                   }
                   else if(j_start<j_end&&i_start>i_end)
                  {
                       strprin("UL",z/2);
                       strprin("UR",x+z/2);
                   }
                    else 
                     {
                       strprin("LR",x+z/2);
                       strprin("LL",z/2);
                   }
                    return;
                   
               }
                else
                {
                    
                       int z=((2*x)-y)/4;
                    cout<<y/2+z<<endl;
                    if(i_start>i_end&&j_start>j_end)
                    {
                        strprin("UL",y/2);
                        strprin("L",z);
                    }
                   else if(j_start>j_end&&i_start<i_end)
                   {
                       strprin("LL",y/2);
                       strprin("L",z);
                   }
                   else if(j_start<j_end&&i_start>i_end)
                  {
                       strprin("UR",y/2);
                       strprin("UR",z);
                   }
                    else 
                     {
                       strprin("LR",y/2);
                       strprin("R",z);
                   }
                    return;
                }
                   
        }
        else 
            cout<<"Impossible";
    
}

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