// https://www.hackerrank.com/contests/world-codesprint-12/challenges/red-knights-shortest-path

#include<bits/stdc++.h>
#define loop(a,b) for(int i=a;i<b;i++)
#define loop2(a,b) for(int j=a;j<b;j++)

using namespace std;

bool inside(int x, int y, int n)
{
    if((x>=0 && x<n) && (y>=0 && y<n))
        return true;
    else
        return false;
}

int main()
{
    int n;
    cin>>n;
    int sx,sy,dx,dy;
    cin>>sx>>sy>>dx>>dy;

    bool vis[n][n];
    memset(vis,0,sizeof(vis));
    int dis[n][n];
    memset(dis,0,sizeof(dis));
    vector< vector<string> > str;
    vector<string> v;
    bool flag;
    loop(0,n)
    {
        str.push_back(v);
    }
    loop(0,n)
    {
        loop2(0,n)
        {
            str[i].push_back("");
            //cout<<str[i][j]<<" ";
        }
      //  cout<<endl;
    }


    int nodex[6] = {-2,-2,0,2,2,0};
    int nodey[6] = {-1,1,2,1,-1,-2};
    loop(0,6)
        v.push_back("");
    v[0] += " UL";
    v[1] += " UR";
    v[2] += " R";
    v[3] += " LR";
    v[4] += " LL";
    v[5] += " L";

    queue<int> qx, qy;
    qx.push(sx);
    qy.push(sy);
    //vis[sx][sy]=1;

    while(!qx.empty())
    {

        int cx = qx.front();
        int cy = qy.front();
         //cout<<"hello "<<cx<<" "<<cy<<endl;
        qx.pop();
        qy.pop();

        vis[cx][cy] =1;

        if(cx == dx && cy == dy)
        {
            flag=1;
            cout<<dis[cx][cy]<<"\n";
            loop(1,str[cx][cy].length())
                cout<<str[cx][cy][i];
            return 0;

        }

        loop(0,6)
        {
           // cout<<"H"<<" ";
            int ix,iy;
            ix = cx + nodex[i];
            iy = cy + nodey[i];
           // cout<<ix<<" "<<iy<<" "<<inside(ix,iy,n)<<endl;
            if(inside(ix,iy,n) && !vis[ix][iy])
            {
                qx.push(ix);
                qy.push(iy);
                dis[ix][iy] = 1 + dis[cx][cy];
                str[ix][iy] =  str[cx][cy] + v[i];
                vis[ix][iy]=1;
            }
        }

    }

    cout<<"Impossible";
}