#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<bits/stdc++.h>
using namespace std;
struct cell
{
    int x, y;
    int dis;
    int px,py;
    cell() {}
    cell(int x, int y, int dis,int px,int py) : x(x), y(y), dis(dis),px(px),py(py) {}
};

bool isInside(int x, int y, int N)
{
    if (x >= 0 && x < N && y >= 0 && y < N)
        return true;
    return false;
}

void minStepToReachTarget(int knightPos[], int targetPos[],int N)
{
    int dx[]={-2,-2,0,2,2,0};
    int dy[]={-1,1,2,1,-1,-2};
    queue<cell> q;
    q.push(cell(knightPos[0], knightPos[1], 0,-1,-1));
    cell t;
    int x, y,xdif,ydif;
    bool visit[N ][N ];
    cell val[N][N];
    for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++)
        {
            visit[i][j] = false;
            val[i][j].dis=99;
        }
    visit[knightPos[0]][knightPos[1]] = true;
    while (!q.empty())
    {
        t = q.front();
        if(t.dis>(val[t.x][t.y].dis))
        {
            q.pop();
            continue;
        }
        val[t.x][t.y]=t;
        q.pop();
        visit[t.x][t.y] = true;
        if (t.x == targetPos[0] && t.y == targetPos[1])
        {
            if(t.dis==-1)
                cout<<"Impossible"<<endl;
            else
            {
                cout<<t.dis<<endl;
                cell k=val[targetPos[0]][targetPos[1]];
                int i;
                vector<string> pp;
                for(i=0; i<t.dis; i++)
                {
                    xdif=(k.x-k.px);
                    ydif=(k.y-k.py);
                    if(xdif==dx[0] && ydif==dy[0])
                        pp.push_back("UL ");
                    else if(xdif==dx[1] && ydif==dy[1])
                        pp.push_back("UR ");
                    else if(xdif==dx[2] && ydif==dy[2])
                        pp.push_back("R ");
                    else if(xdif==dx[3] && ydif==dy[3])
                        pp.push_back("LR ");
                    else if(xdif==dx[4] && ydif==dy[4])
                        pp.push_back("LL ");
                    else if(xdif==dx[5] && ydif==dy[5])
                        pp.push_back("L ");
                    k=val[k.px][k.py];
                }
                int l=pp.size();
                for(i=l-1; i>=0; i--)
                {
                    cout<<pp[i];
                }
                cout<<endl;
                return;
            }
        }
        for (int i = 0; i < 6; i++)
        {
            x = t.x + dx[i];
            y = t.y + dy[i];

            if (isInside(x, y, N) && !visit[x][y])
            {
                q.push(cell(x, y, t.dis + 1,t.x,t.y));
            }
        }
    }
                    cout<<"Impossible"<<endl;
    return ;
}

int main() {
    int n,xs,ys,xd,yd;
    cin>>n;
    cin>>xs>>ys>>xd>>yd;
    int knightPos[] = {xs, ys};
    int targetPos[] = {xd, yd};
    int i;
    minStepToReachTarget(knightPos, targetPos, n);
    return 0;
}