//Red Knight's Shortest Path
//https://www.hackerrank.com/contests/world-codesprint-12/challenges/red-knights-shortest-path
#include <iostream>
#include <queue>
#include <cstring>
#include <utility>
#include <vector>
#include <string>
using namespace std;

int n,sx,sy,ex,ey,dis[205][205],par[205][205];
pair <int,int> save[205][205];
queue <pair <int,int> > q;
vector <string> v;
int korX[6]{-2,-2,0,2,2,0};
int korY[6]={-1,1,2,1,-1,-2};

int main()
{
    ios_base::sync_with_stdio(0);
    cin>>n;
    cin>>sx>>sy>>ex>>ey;
    memset(dis,-1,sizeof(dis));
    memset(par,-1,sizeof(par));
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
            save[i][j]=make_pair(-1,-1);
    }
    dis[sx][sy]=0;
    q.push(make_pair(sx,sy));
    while(!q.empty())
    {
        int ux=(q.front()).first;
        int uy=(q.front()).second;
        q.pop();
        for(int rr=0;rr<6;rr++)
        {
            int vx=ux+korX[rr];
            int vy=uy+korY[rr];
            if(vx>=0 && vx<n && vy>=0 && vy<n)
            {
                if(dis[vx][vy]==-1 || dis[vx][vy]>dis[ux][uy]+1)
                {
                    dis[vx][vy]=dis[ux][uy]+1;
                    par[vx][vy]=rr;
                    save[vx][vy]=make_pair(ux,uy);
                    q.push(make_pair(vx,vy));
                }
            }
        }
    }
    if(dis[ex][ey]==-1)
    {
        cout<<"Impossible";
        return 0;
    }
    cout<<dis[ex][ey]<<"\n";
    int curx=ex,cury=ey;
    while(par[curx][cury]!=-1)
    {
        if(par[curx][cury]==0)
            v.push_back("UL");
        if(par[curx][cury]==1)
            v.push_back("UR");
        if(par[curx][cury]==2)
            v.push_back("R");
        if(par[curx][cury]==3)
            v.push_back("LR");
        if(par[curx][cury]==4)
            v.push_back("LL");
        if(par[curx][cury]==5)
            v.push_back("L");
        int helpx,helpy;
        helpx=save[curx][cury].first;
        helpy=save[curx][cury].second;
        curx=helpx;
        cury=helpy;
    }
    for(int i=v.size()-1;i>=0;i--)
        cout<<v[i]<<" ";
    return 0;
}