#include <bits/stdc++.h>

using namespace std;
#define gin getchar_unlocked
#define MAX 40005
#define pb push_back
#define mp make_pair
#define initial 1
#define waiting 2
#define visited 3

vector< pair<int,int> > graph[MAX];
int state[MAX];
int parent[MAX];
int parentP[MAX];
int dist[MAX];
int x;
queue<int> queuee;
void in(int &n)
{
    n = 0;
    int cr = gin();
    int s = 1;
    while (cr < '0' || cr > '9')
    {
        if (cr == '-')
            s = -1;
        cr = gin();
    }
    while (cr >= '0' && cr <= '9')
        n = (n << 3) + (n << 1) + cr - '0', cr = gin();
    n = n * s;
}

void BFS(int v)
{
    int i;
    queuee.push(v);
    state[v] = waiting;
    //dist[v]=0;
    while (!queuee.empty())
    {
        v = queuee.front();
        queuee.pop();
        //printf("%d",v);
        state[v] = visited;
        for (i = 0; i < graph[v].size(); i++)
        {
            int xq = graph[v][i].first;
            if (state[xq] == initial)
            {
                queuee.push(xq);
                state[xq] = waiting;
                parent[xq] = v;
                parentP[xq] = graph[v][i].second;
            }
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    int n, xs, ys, xe, ye;
    int ul, ur, r, lr, ll, l, temp;
    int tx, ty;
    in(n);
    in(xs);
    in(ys);
    in(xe);
    in(ye);
    memset(state, 1, sizeof(state));
    memset(parent, -1, sizeof(parent));
    memset(parentP, -1, sizeof(parentP));
    memset(dist, 0, sizeof(dist));
    
    x = n * n;
    for(int i=0;i<x;i++)
    {
        state[i]=1;
        parent[i]=-1;
        parentP[i]=-1;
    }
    /*for(int i=0;i<x;i++)
    {
        cout<<state[i]<<" ";
        
    }*/
    //cout<<endl;
    for (int i = 0; i < x; i++)
    {
        temp = i;
        int xx = i / n;
        int yy = i % n;
        tx = xx - 2;
        ty = yy - 1;
        ul=tx*n+ty;
        if (tx >= 0 && ty >= 0 && tx < n && ty < n)
        {
            ul=tx * n + ty;
            graph[i].pb(mp(tx * n + ty,0));
            //graph[ul].pb(mp(i,0));
        }

        tx = xx - 2;
        ty = yy + 1;
        if (tx >= 0 && ty >= 0 && tx < n && ty < n)
        {
            ul=tx * n + ty;
            graph[i].pb(mp(tx * n + ty,1));
            //graph[ul].pb(mp(i,1));
        }
        tx = xx;
        ty = yy + 2;
        if (tx >= 0 && ty >= 0 && tx < n && ty < n)
        {
            ul=tx * n + ty;
            graph[i].pb(mp(tx * n + ty,2));
            //graph[ul].pb(mp(i,2));
        }
        tx = xx + 2;
        ty = yy + 1;
        if (tx >= 0 && ty >= 0 && tx < n && ty < n)
        {
            ul=tx * n + ty;
            graph[i].pb(mp(tx * n + ty,3));
            //graph[ul].pb(mp(i,3));
        }
        tx = xx + 2;
        ty = yy - 1;
        if (tx >= 0 && ty >= 0 && tx < n && ty < n)
        {
            ul=tx * n + ty;
            graph[i].pb(mp(tx * n + ty,4));
            //graph[ul].pb(mp(i,4));
        }
        tx = xx;
        ty = yy - 2;
        if (tx >= 0 && ty >= 0 && tx < n && ty < n)
        {
            ul=tx * n + ty;
            graph[i].pb(mp(tx * n + ty,5));
            //graph[ul].pb(mp(i,5));
        }
    }
    /*for (int i = 0; i < x; i++)
    {
        cout<<i<<" -- ";
        for (int j = 0; j < graph[i].size(); j++)
            cout << graph[i][j].first << " ";
        cout << "\n";
    }*/
    int start = xs * n + ys;
    int end = xe * n + ye;
    BFS(start);
    //cout<<"SDfsdfsd"<<state[end]<<endl;
    //cout<<start<<"++"<<end<<endl;
    if (parent[end]!=-1)
    {
        int ttemp = end;
        vector<string> paths;
        int ccc = 0;
        while (ttemp != start)
        {
            //cout<<ttemp<<" ";
            if (parentP[ttemp] == 0)
                paths.pb("UL");
            else if (parentP[ttemp] == 1)
                paths.pb("UR");
            else if (parentP[ttemp] == 2)
                paths.pb("R");
            else if (parentP[ttemp] == 3)
                paths.pb("LR");
            else if (parentP[ttemp] == 4)
                paths.pb("LL");
            else if (parentP[ttemp] == 5)
                paths.pb("L");
            ccc += 1;
            ttemp = parent[ttemp];
        }
        //cout<<endl;
        cout << ccc << "\n";
        for(int i=paths.size()-1;i>0;i--)
            cout<<paths[i]<<" ";
        cout<<paths[0];
        //cout << s;
    }
    else
        cout << "Impossible";
}