#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

struct Position {
        int i, j;
};

struct Move {
        string str;
        int i, j;
};

int quadrant(Position &o, Position &t) {
        if (t.i < o.i) {
                return (t.j <= o.j)? 1: 2;
        } else {
                return (t.j >= o.j)? 3: 4;
        }
}

bool solve(int n, Position &s, Position &e, vector<string> &ans) {
        int height = abs(e.i - s.i);
        int width = abs(e.j - s.j);
        if ((height & 1) || (abs(width - (height / 2)) & 1))
                return false;

        int q = quadrant(s, e);
        int hMove = height / 2;
        int wMove = width / 2;
        if (width < hMove) {
                int forward = (hMove - width) / 2 + width;
                int backward = hMove - forward;
                switch (q) {
                case 1:
                        while (forward + backward) {
                                if (forward && s.j > 0) {
                                        --forward;
                                        --s.j;
                                        ans.emplace_back("UL");
                                } else {
                                        --backward;
                                        ++s.j;
                                        ans.emplace_back("UR");
                                }
                        }
                        break;
                case 2:
                        while (forward + backward) {
                                if (backward && s.j > 0) {
                                        --backward;
                                        --s.j;
                                        ans.emplace_back("UL");
                                } else {
                                        --forward;
                                        ++s.j;
                                        ans.emplace_back("UR");
                                }
                        }
                        break;
                case 3:
                        while (forward + backward) {
                                if (forward && s.j + 1 < n) {
                                        --forward;
                                        ++s.j;
                                        ans.emplace_back("LR");
                                } else {
                                        --backward;
                                        --s.j;
                                        ans.emplace_back("LL");
                                }
                        }
                        break;
                case 4:
                        while (forward + backward) {
                                if (backward && s.j + 1 < n) {
                                        --backward;
                                        ++s.j;
                                        ans.emplace_back("LR");
                                } else {
                                        --forward;
                                        --s.j;
                                        ans.emplace_back("LL");
                                }
                        }
                        break;
                }
        } else {
                int diagonal = hMove;
                int parallel = (width - hMove) / 2;
                switch (q) {
                case 1:
                        while (diagonal--)
                                ans.emplace_back("UL");
                        while (parallel--)
                                ans.emplace_back("L");
                        break;
                case 2:
                        while (diagonal--)
                                ans.emplace_back("UR");
                        while (parallel--)
                                ans.emplace_back("R");
                        break;
                case 3:
                        while (parallel--)
                                ans.emplace_back("R");
                        while (diagonal--)
                                ans.emplace_back("LR");
                        break;
                case 4:
                        while (diagonal--)
                                ans.emplace_back("LL");
                        while (parallel--)
                                ans.emplace_back("L");
                        break;
                }
        }

        return true;
}

int main(void) {
        cout.sync_with_stdio(false);
        int n;
        cin >> n;
        Position start, end;
        cin >> start.i >> start.j >> end.i >> end.j;

        vector<string> ans;
        if (!solve(n, start, end, ans)) {
                cout << "Impossible\n";
        } else {
                cout << ans.size() << '\n';
                for (auto &s : ans)
                        cout << s << ' ';
                cout << '\n';
        }
        return 0;
}