#include <bits/stdc++.h>

using namespace std;

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

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