#include <bits/stdc++.h>

using namespace std;
string s[100001];
int count1;
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    //cout<<"ki";
    count1 = 0;
    int k = 0;
    if(i_start==i_end && j_start==j_end)
    {
        cout<<"0";
    }
    else if((i_start%2==0 && i_end%2!=0) || (i_start%2!=0 && i_end%2==0))
    {
        cout<<"Impossible";
    }
    else
    {
        int l1 = i_start,l2 = j_start,m1 = i_end,m2 = j_end;
        if(i_end>=i_start && j_end>j_start)
        {
            int p = 0,j=j_start;
            j += (i_end-i_start)/2;
            while(j<j_end)
            {
                j+=2;
                p++;
            }
            for(int i=0;i<p;i++)
            {
                s[k] = "R";
                k++;
                l2+=2;
            }
        }
        int flag=0;
        while(l1!=m1)
        {
            if(l1<m1)
            {
                flag=1;
                if(m2<l2)
                {
                    s[k] = "LL";
                    k++;
                    l1+=2;
                    l2-=1; 
                }
                else
                {
                    s[k] = "LR";
                    k++;
                    l1+=2;
                    l2+=1;
                }
            }
            else
            {
                if(m2>l2)
                {
                    //cout<<"00"<<endl;
                    s[k] = "UR";
                    k++;
                    l1-=2;
                    l2+=1;
                }
                else
                {
                    //cout<<"11"<<endl;
                    s[k] = "UL";
                    k++;
                    l1-=2;
                    l2-=1;
                }
            }
            //cout<<l1<<" "<<l2<<endl;
            count1++;
        }
        if(l2>m2)
        {
            while(l2>m2)
            {
                l2-=2;
                s[k] = "L";
                k++;
                count1++;
                //cout<<l1<<" "<<l2<<endl;
            }
            if(l2==m2)
            {
                cout<<k<<endl;
                if(flag==0){
                   // cout<<"ll";
                for(int i=0;i<k;i++)
                {
                    cout<<s[i]<<" ";
                }
                }
                else
                {
                    //cout<<"ki";
                    for(int i=0;i<k;i++)
                    {
                        if(s[i]=="LR")
                            cout<<s[i]<<" ";
                    }
                    for(int i=0;i<k;i++)
                    {
                        if(s[i]=="LL")
                            cout<<s[i]<<" ";
                    }
                }
                //cout<<s[k-1];
                //cout<<"Yes"<<count1<<endl;
            }
            else
            {
                cout<<"Impossible";
            }
        }
        else if(l2<m2)
        {
           while(l2<m2)
            {
                l2+=2;
                s[k] = "R";
                k++;
                count1++;
                //cout<<l1<<" "<<l2<<endl;
            }
            if(l2==m2)
            {
                cout<<k<<endl;
                if(flag==0){
                    //cout<<"olo";
                for(int i=0;i<k;i++)
                {
                    cout<<s[i]<<" ";
                }
                }
                else
                {
                    //cout<<"tt";
                    for(int i=0;i<k;i++)
                    {
                        if(s[i]=="R")
                            cout<<s[i]<<" ";
                    }
                    for(int i=0;i<k;i++)
                    {
                        if(s[i]=="LR")
                            cout<<s[i]<<" ";
                    }
                    for(int i=0;i<k;i++)
                    {
                        if(s[i]=="LL")
                            cout<<s[i]<<" ";
                    }
                    for(int i=0;i<k;i++)
                    {
                        if(s[i]=="L")
                            cout<<s[i]<<" ";
                    }
                }
            }
            else
            {
                cout<<"Impossible"<<endl;
            } 
        }
        else
        {
            cout<<k<<endl;
            if(flag==1)
            {
                for(int i=0;i<k;i++)
                    {
                        if(s[i]=="R")
                            cout<<s[i]<<" ";
                    }
            for(int i=0;i<k;i++)
                    {
                        if(s[i]=="LR")
                            cout<<s[i]<<" ";
                    }
                    for(int i=0;i<k;i++)
                    {
                        if(s[i]=="LL")
                            cout<<s[i]<<" ";
                    }
                    for(int i=0;i<k;i++)
                    {
                        if(s[i]=="L")
                            cout<<s[i]<<" ";
                    }
            }
            else
            {
                for(int i=0;i<k;i++)
                {
                    cout<<s[i]<<" ";
                }
            }
            //cout<<"Yes"<<endl;
        }
    }
}

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