#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    vector <string> v;
   int i=abs(i_end-i_start), j=abs(j_end-j_start);
    if(i%2==0)
    {
        int step=i/2;
        if(abs(step-j)%2==0)
        {
           if(i_start>i_end)  ///UL and UR
                {
                    if(step>=j) //10   6
                    {
                        if(j_start>j_end) ///end.........start
                        {
                           int l= (step-j)/2;
                            for(int k=0;k<step-l;k++)
                            v.push_back("UL");
                            for(int k=0;k<l;k++)
                            v.push_back("UR");
                        }
                        else   ///start..........end
                        {
                           int l= (step-j)/2;
                            for(int k=0;k<l;k++)
                            v.push_back("UL") ;
                            for(int k=0;k<step-l;k++)
                            v.push_back("UR");
                        }
                    }
                    else //6 10
                    {
                        if(j_start>j_end) ///end.........start
                            {
                               int l= abs(step-j);
                                for(int k=0;k<step;k++)
                                v.push_back("UL");
                                    l/=2;
                                for(int k=0;k<l;k++)
                                v.push_back("L");
                            }
                            else   ///start..........end
                            {
                               int l= abs(step-j)/2;
                                for(int k=0;k<step;k++)
                                v.push_back("UR");
                                for(int k=0;k<l;k++)
                                v.push_back("R") ;
                            }  
                    }
                }
              else if(i_end>i_start) // LL and LR
                {
                     if(step>=j) //10   6
                    {
                        if(j_start>j_end) ///end.........start
                        {
                           int l= (step-j)/2; 
                            for(int k=0;k<l;k++)
                            v.push_back("LR");
                            for(int k=0;k<step-l;k++)
                            v.push_back("LL");
                        }
                        else   ///start..........end
                        {
                           int l= (step-j)/2;
                            for(int k=0;k<step-l;k++)
                            v.push_back("LR");
                            for(int k=0;k<l;k++)
                            v.push_back("LL") ;
                        }
                    }
                    else //6 10
                    {
                        if(j_start>j_end) ///end.........start
                            {
                               int l= abs(step-j);
                                for(int k=0;k<step;k++)
                                v.push_back("LL");
                                    l/=2;
                                for(int k=0;k<l;k++)
                                v.push_back("L");
                            }
                            else   ///start..........end
                            {
                               int l= abs(step-j)/2;
                                for(int k=0;k<l;k++)
                                v.push_back("R") ;
                                for(int k=0;k<step;k++)
                                v.push_back("LR");
                                
                            }  
                    }

                }
                else
                {
                    if(j_end>j_start)
                    {
                        for(int k=0;k<(j_end-j_start)/2;k++)
                            v.push_back("R");
                    }
                    if(j_end<j_start)
                    {
                        for(int k=0;k<abs(j_end-j_start)/2;k++)
                            v.push_back("L");
                    }
                }
            cout<<v.size()<<endl;
            for(int k=0;k<v.size();k++)
                cout<<v[k]<<" ";
            cout<<endl;
            }
        else
            cout<<"Impossible\n";
    }
    else
        cout<<"Impossible\n";
   
}

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