#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i<= b; ++i)
#define FORD(i, a, b) for (int i = a; i>=b; --i)
#define REP(i, a) for (int i = 0; i<a; ++i)
#define N 1001
#define pp pair<int, int>
#define bit(S, i) (((S) >> i) & 1)
#define IO cin.tie(NULL);cout.tie(NULL);
#define taskname ""
using namespace std;

int n, sx, sy, fx, fy;
bool fr[N][N];
queue<pp> q;

bool inside(int i, int j) {
    return i >= 0 && j >= 0 && i < n && j < n;
}
const int d[6] = {-2, -2, 0, 2, 2, 0};
const int c[6] = {-1, 1, 2, 1, -1, -2};
const string cm[6] = {"UL", "UR", "R", "LR", "LL", "L"};
int bef[N][N];

void Trace(pp u, int sz) {
    int i = bef[u.first][u.second];
    if (u != pp(sx, sy)) Trace(pp(u.first - d[i],u.second - c[i]), sz + 1);
    else cout<<sz<<endl;
    if (u != pp(sx, sy)) cout<< cm[i] << ' ';
}
void BFS() {
    fr[sx][sy] = true;
    q.push(pp(sx, sy));
    while (!q.empty()) {
        pp u = q.front(); q.pop();
        REP(i, 6) {
            pp v = pp(u.first + d[i], u.second + c[i]);
            if (inside(v.first, v.second) && !fr[v.first][v.second]) {
                fr[v.first][v.second] = true;
                q.push(v);
                bef[v.first][v.second] = i;
                if (v == pp(fx, fy)) {
                    Trace(v, 0);
                    return;
                }
            }
        }
    }
    printf("Impossible");
}
int main() {
   // freopen(taskname".inp","r",stdin);
   // freopen(taskname".out","w",stdout);
    IO;ios::sync_with_stdio(false);
    //scanf("%d %d %d %d %d", &n, &sx, &sy, &fx, &fy);
    cin>>n>>sx>>sy>>fx>>fy;
    BFS();
}