#include <bits/stdc++.h>

using namespace std;

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<<i_start<<" "<<j_start<<endl;;
    int x1 = abs(i_start - j_start);
    int y1 = abs(i_end - j_end);
    if(x1%2==1)
    {
        cout<<"Impossible\n";
        return;
    }
    if(x1%4==0 and y1%2==1)
    {
        cout<<"Impossible\n";
        return;
    }
    if(x1%4==2 and y1%2==0)
    {
        cout<<"Impossible\n";
        return;
    }
    int ans = 0;
    int x2 = x1/2;
    int y2 = (y1-x2)/2;
    ans = x2+y2;
    if(x1==0)
    {
        cout<<ans<<endl;
        if(j_end>i_end)
        {   for (int i = 0; i < y2; ++i)
            {
                cout<<"R ";
            }
        }
        else
        {
            for (int i = 0; i < y2; ++i)
            {
                cout<<"L ";
            }
        }
        cout<<endl;
        return;
    }
    if(j_start>i_start)
    {
        y1 = (j_end - i_end);
        if(2*y1>=x1)
        {
            cout<<ans<<endl;
            for (int i = 0; i < y2; ++i)
            {
                cout<<"R ";
            }
            for (int i = 0; i < x2; ++i)
            {
                cout<<"LR ";
            }
        }
        else if(-2*y1>=x1)
        {
            cout<<ans<<endl;
            for (int i = 0; i < x2; ++i)
            {
                cout<<"LR ";
            }
            for (int i = 0; i < y2; ++i)
            {
                cout<<"L ";
            }
        }
        else
        {
            x2 = (x2+y1)/2;
            y2 = x2-y1;
            ans = x2+y2;
            cout<<ans<<endl;
            for (int i = 0; i < x2; ++i)
            {
                cout<<"LR ";
            }
            for (int i = 0; i < y2; ++i)
            {
                cout<<"LL ";
            }
        }
    }
    else
    {
        y1 = (j_end - i_end);
        // cout<<x1<<" "<<y1<<endl;
        if(2*y1>=x1)
        {
            cout<<ans<<endl;
            for (int i = 0; i < x2; ++i)
            {
                cout<<"UR ";
            }
            for (int i = 0; i < y2; ++i)
            {
                cout<<"R ";
            }
        }
        else if(-2*y1>=x1)
        {
            cout<<ans<<endl;
            for (int i = 0; i < x2; ++i)
            {
                cout<<"UL ";
            }
            for (int i = 0; i < y2; ++i)
            {
                cout<<"L ";
            }
        }
        else
        {
            x2 = (x2+y1)/2;
            y2 = x2-y1;
            ans = x2+y2;
            cout<<ans<<endl;
            for (int i = 0; i < x2; ++i)
            {
                cout<<"UL ";
            }
            for (int i = 0; i < y2; ++i)
            {
                cout<<"R ";
            }
        }
    }
    cout<<endl;
    return; 
}

int main() {
    int n;
    cin >> n;
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> i_end >> j_start >> j_end;
    printShortestPath(n,i_start,j_start,i_end,j_end);
    return 0;
}