#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int s1, int s2, int d1, int d2) {
    
    if((d1-s1)%2!=0)
    {
        cout<<"Impossible";
        return ;
    }
    else if(s1==d1 && s2==d2)
    {
        cout<<"0";
        return;
    }
    else
    {   
        
        if(s2==d2)
        {
            if(((s1-d1)/2)%2!=0)
            {
                cout<<"Impossible";
                return;
            }
            else if(d1>s1)
            {
                int i = abs(d1-s1)/2;
                cout<<i<<endl;
                for(int j=0;j<i;j++)
                {
                    if(j%2==0)cout<<"LR ";
                    else cout<<"LL ";
                }
                return;
                
            }
            else
            {
                int i = abs(d1-s1)/2;
                cout<<i<<endl;
                for(int j=0;j<i;j++)
                {
                    if(j%2==0)cout<<"UR ";
                    else cout<<"UL ";
                }
                return;
            }
            
        }//al cases for s2==d2
        else if((s2-d2)%2==0)
        {
            if(s1==d1)
            {
                if(d2>s2)
                {
                    int j= (d2-s2)/2;
                    cout<<j<<endl;
                    while(j>0)
                    {
                        cout<<"R ";
                        j--;
                    }
                }
                else
                {
                    
                    int j= (s2-d2)/2;
                    cout<<j<<endl;
                    while(j>0)
                    {
                        cout<<"L ";
                        j--;
                    }
                }
                        
            }
            
            else if(d2>s2  && d1<s1)
            {
                if((((s1-d1)/2)%2)!=0)
                {
                    cout<<"Impossible";
                    return;
                }
                else
                {
                    int i1=s1-d1,i2=d2-s2;
                    
                    
                }
            }
            else if(d2>s2  && d1>s1)
            {
                
                if((((s1-d1)/2)%2)!=0)
                {
                    cout<<"Impossible";
                    return;
                }
                
            }
            else if(d2<s2   && d1<s1)
            {
                 cout<<"Impossible";
                    return;
            }
            else//d2<s2  && d1>s1
            {
                 cout<<"Impossible";
                    return;
            }
        }//all cases when s2-d2 is even
        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;
}