//Bismillahir Rahmanir Rahim
#include <bits/stdc++.h>
using namespace std;

#define MAX 200
#define MEMSET(x,y) memset(x, y, sizeof(x))
#define PB push_back
#define MP make_pair
#define NO_OF_MOVES 6

int color[MAX+9][MAX+9], dis[MAX+9][MAX+9];
pair<int, int> par[MAX+9][MAX+9];
queue<pair<int, int> >Q;
vector<string>ANS;

int dx[] = {-2,-2,0,2,2,0};
int dy[] = {-1,1,2,1,-1,-2};
string MOVES[] = {"UL", "UR", "R", "LR", "LL", "L"};

string GET_MOVE(pair<int, int> E, pair<int, int> S)
{
    for(int i;i<NO_OF_MOVES;i++) if(S.first + dx[i] == E.first && S.second + dy[i] == E.second) return MOVES[i];
    return "Impossible";
}

void Bfs_2D(int sx, int sy,int n, int m)
{
    int x,y,xx,yy,i;
    while(!Q.empty()) Q.pop();
    Q.push(make_pair(sx, sy));
    dis[sx][sy] = 0;
    color[sx][sy] = 1;

    while(!Q.empty())
    {
        x = Q.front().first;
        y = Q.front().second;
        Q.pop();

        for(i=0; i<NO_OF_MOVES; i++)
        {
            xx = x + dx[i];
            yy = y + dy[i];
            if(xx<0 || xx>=n || y<0 || yy>=m) continue;
            if(color[xx][yy]) continue;

            Q.push(make_pair(xx,yy));
            dis[xx][yy] = dis[x][y] + 1;
            color[xx][yy] = 1;
            par[xx][yy] = make_pair(x,y);
        }
    }

}


int main()
{
    int i,j,k,l,m,n,ans,tot,sum,temp,test,siz,lst,sx,sy,ex,ey;
    pair<int,int> parent;

    cin>>n;
    cin>>sx>>sy>>ex>>ey;

    Bfs_2D(sx, sy, n, n);

    if(color[ex][ey])
    {
        cout<<dis[ex][ey]<<endl;
        while(!(ex==sx && ey==sy))
        {
            ANS.push_back(GET_MOVE(make_pair(ex,ey), par[ex][ey]));
            parent = par[ex][ey];
            ex = parent.first;
            ey = parent.second;
        }

        for(i=ANS.size()-1;i>=0;i--) cout<<ANS[i]<<" ";cout<<endl;
    }
    else cout<<"Impossible\n";


}