#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i1, int j1, int i2, int j2) 
{
    //  Print the distance along with the sequence of moves.
    if(abs(i2-i1)%2)
    {
        cout<<"Impossible";
        return;
    }
    if(abs(abs(j2-j1)-(abs(i2-i1)/2))%2)
    {
        cout<<"Impossible";
        return;
    }
    
    vector<int> s;
    int a=0;
    while(abs(i2-i1)!=0||abs(j2-j1)!=0)
    {
        if(i2>i1)
        {
            if(j2>j1)
            {
                s.push_back(4);
                j1+=1;
                i1+=2;
                a++;
            }
            else if(j2<j1)
            {
                s.push_back(5);
                j1-=1;
                i1+=2;
                a++;
            }
            else
            {
                if(j1+1<n)
                {
                    s.push_back(4);
                    j1+=1;
                    i1+=2;
                    a++;
                }
                else
                {
                    s.push_back(5);
                    j1-=1;
                    i1+=2;
                    a++;
                }
            }
        }
        else if(i2<i1)
        {
            if(j2>j1)
            {
                s.push_back(2);
                j1+=1;
                i1-=2;
                a++;
            }
            else if(j2<j1)
            {
                s.push_back(1);
                j1-=1;
                i1-=2;
                a++;
            }
            else
            {
                if(j1-1>-1)
                {
                    s.push_back(1);
                    j1-=1;
                    i1-=2;
                    a++;
                }
                else
                {
                    s.push_back(2);
                    j1+=1;
                    i1-=2;
                    a++;
                }
            }
        }
        else if(i2==i1)
        {
            if(j2>j1)
            {
                s.push_back(3);
                j1+=2;
                a++;
            }
            else if(j2<j1)
            {
                s.push_back(6);
                j1-=2;
                a++;
            }
        }
    }
    cout<<a<<endl;
    sort(s.begin(),s.end());
    for(int i=0;i<s.size();i++)
    {
        if(s[i]==1)
            cout<<"UL ";
        if(s[i]==2)
            cout<<"UR ";
        if(s[i]==3)
            cout<<"R ";
        if(s[i]==4)
            cout<<"LR ";
        if(s[i]==5)
            cout<<"LL ";
        if(s[i]==6)
            cout<<"L ";
    }
}

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