#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template<typename T> inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

const int MAX = 222;
const int dx[] = {0, -2, 2, -2, 2, 0};
const int dy[] = {-2, -1, -1, 1, 1, 2};
const string dWord[] = {"L", "UL", "LL", "UR", "LR", "R"};
// UL, UR, R, LR, LL, L.
const int pri[] = {1, 3, 5, 4, 2, 0};
int n;
int sx, sy, tx, ty;
int minCost[MAX][MAX];

bool inside(int nx, int ny) {
    return 0 <= nx && nx < n && 0 <= ny && ny < n;
}

int main(void) {
    cin >> n;
    cin >> sx >> sy >> tx >> ty;
    if (sx == tx && sy == ty) {
        puts("0");
        return 0;
    }
    queue<tuple<int, int, int>> q;
    q.emplace(sx, sy, 0);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            minCost[i][j] = INF;
        }
    }
    while (!q.empty()) {
        int nx, ny, cost;
        tie(nx, ny, cost) = q.front();
        q.pop();
        if (!chmin(minCost[nx][ny], cost)) {
            continue;
        }
        for (int di = 0; di < 6; di++) {
            int d = pri[di];
            const int nxtX = nx + dx[d];
            const int nxtY = ny + dy[d];
            //cerr << nxtX << " " << nxtY << " " << cost << endl;
            if (!inside(nxtX, nxtY)) {
                continue;
            }
            if (minCost[nxtX][nxtY] <= cost + 1) {
                continue;
            }
            q.emplace(nxtX, nxtY, cost + 1);
        }
    }
    if (minCost[tx][ty] == INF) {
        // for (int i = 0; i < n; i++) {
        //     for (int j = 0; j < n; j++) {
        //         cout << (minCost[i][j] == INF ? "!" : to_string(minCost[i][j])) << " ";
        //     }
        //     cout << endl;
        // }
        puts("Impossible");
        return 0;
    }
    cout << minCost[tx][ty] << endl;
    VI stepWord;
    int nowX = tx, nowY = ty;
    while (nowX != sx || nowY != sy) {
        for (int di = 0; di < 6; di++) {
            int d = pri[5 - di];
            int prevX = nowX - dx[d];
            int prevY = nowY - dy[d];
            if (!inside(prevX, prevY)) {
                continue;
            }
            if (minCost[prevX][prevY] + 1 == minCost[nowX][nowY]) {
                nowX = prevX;
                nowY = prevY;
                stepWord.emplace_back(d);
                break;
            }
        }
    }
    reverse(stepWord.begin(), stepWord.end());
    for (int i = 0; i < stepWord.size(); i++) {
        printf("%s%c", dWord[stepWord[i]].c_str(), (i + 1 == stepWord.size() ? '\n' : ' '));
    }
}