#include <bits/stdc++.h>

#define MaxN 205
#define INF 2140000000
#define MOD 1193
#define SQRT 1400

using namespace std;

int dx[6]={-2,-2,0,2,2,0},dy[6]={-1,1,2,1,-1,-2};
string name[6]={"UL ","UR ","R ","LR ","LL ","L "};
int N,X1,Y1,X2,Y2;

struct Matrix
{
    int dist,type,fx,fy;
}Mat[MaxN][MaxN];
vector<string>S;
queue<pair<int,int> >Q;
void BFS(int X,int Y)
{
    Q.push({X,Y});
    Mat[X][Y].dist=0;
    while(!Q.empty())
    {
        X=Q.front().first;
        Y=Q.front().second;
        Q.pop();
        for(int i=0;i<6;i++)
        {
            if(X+dx[i]>=0&&X+dx[i]<N&&Y+dy[i]>=0&&Y+dy[i]<N&&Mat[X+dx[i]][Y+dy[i]].dist>Mat[X][Y].dist+1)
            {
                Mat[X+dx[i]][Y+dy[i]].dist=Mat[X][Y].dist+1;
                Mat[X+dx[i]][Y+dy[i]].fx=X;
                Mat[X+dx[i]][Y+dy[i]].fy=Y;
                Mat[X+dx[i]][Y+dy[i]].type=i;
                Q.push({X+dx[i],Y+dy[i]});
            }
        }
    }
}
int main()
{
    cin>>N>>X1>>Y1>>X2>>Y2;
    for(int i=0;i<N;i++)
        for(int j=0;j<N;j++)
            Mat[i][j].dist=INF;
    BFS(X1,Y1);
    if(Mat[X2][Y2].dist==INF)
    {
        cout<<"Impossible\n";
        return 0;
    }
    cout<<Mat[X2][Y2].dist<<'\n';
    while(Mat[X2][Y2].dist)
    {
        X1=Mat[X2][Y2].fx;
        Y1=Mat[X2][Y2].fy;
        S.push_back(name[Mat[X2][Y2].type]);
        X2=X1,Y2=Y1;
    }
    for(int i=S.size()-1;i>=0;i--)
        cout<<S[i];
    return 0;
}