#include <bits/stdc++.h>

using namespace std;

//UL, UR, R, LR, LL, L

int x[6][2] = {{-2,-1},{-2,1},{0,2},{2,1},{2,-1},{0,-2}};

string find(int a, int b)
{
    if(a==-2)
    {
        if(b==-1)
        {
            return "UL";
        }
        else
        {
            return "UR";
        }
    }
    else if(a==0)
    {
        if(b==2)
        {
            return "R";
        }
        else
        {
            return "L";
        }
    }
    else
    {
        if(b==1)
        {
            return "LR";
        }
        else
        {
            return "LL";
        }
    }
    return NULL;
}

void printShortestPath(int n, int a, int b, int c, int d) {
    
    queue<pair<int,int>> q;
    pair<int,int> p,p1;
    p = make_pair(a,b);
    q.push(p);
    map<pair<int,int>, int> m;
    map<pair<int,int>,pair<int,int>> parent;
    m[p] = 0;
    vector<vector<bool>> visited(n,vector<bool>(n,false));
    bool d1 = false;
    int a1,a2,b1,b2,i;
    while(!q.empty())
    {
        p = q.front();
        a1 = p.first;
        a2 = p.second;
        if(a1==c && a2==d)
        {
            d1 = true;
            break;
        }
        //visited[a1][a2] = true;
        for(i=0;i<6;i++)
        {
            b1 = a1+x[i][0];
            b2 = a2+x[i][1];
            p1 = make_pair(b1,b2);
            if(b1>=0 && b1<n && b2>=0 && b2<n && !visited[b1][b2])
            {
                visited[b1][b2] = true;
                m[p1] = m[p]+1;
                parent[p1] = p;
                q.push(p1);
            }
        }
        q.pop();
    }
    p = make_pair(c,d);
    p1 = make_pair(a,b);
    pair<int,int> r;
    if(!d1)
    {
        cout<<"Impossible"<<endl;
    }
    else
    {
        cout<<m[p]<<endl;
        stack<string> s;
        while(p!=p1)
        {
            r = parent[p];
            s.push(find(p.first - r.first,p.second - r.second));
            p = r;
        }
        while(!s.empty())
        {
            cout<<s.top()<<" ";
            s.pop();
        }
    }
    //  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;
}