#include <bits/stdc++.h>
#include <vector>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    int i_diff = abs(i_start - i_end);
    int j_diff = j_start - j_end;
    if (i_diff % 2 == 1 || (j_diff - i_diff)%2 == 1) {
        cout << "Impossible\n";
        return;
    }
    cerr << i_diff <<endl << j_diff << endl;
    enum dir {UL, UR, R, LR, LL, L};
    vector<dir> steps;
    int sidesteps = (abs(j_diff)- i_diff/2)/2;
    if (sidesteps < 0) sidesteps = 0;
    for (int i=0; i<sidesteps; ++i) {
        if (j_diff > 0) {
            steps.push_back(L);
            cerr << "L\n";
        } else {
            steps.push_back(R);
            cerr << "R\n";
        }
    }
    if (j_diff > 0) {
        j_diff -= 2*sidesteps;
    } else {
        j_diff += 2*sidesteps;
    }
    for (int i=0; i<i_diff; i+=2) {
        cerr << "j_diff=" << j_diff <<endl;
        if (i_start > i_end) {
            if (j_diff < 0) {
                steps.push_back(UR);
                ++j_diff;
            } else {
                steps.push_back(UL);
                --j_diff;
            }
        } else {
            if (j_diff > 0) {
                steps.push_back(LL);
                --j_diff;
            } else {
                steps.push_back(LR);
                ++j_diff;
            }
        }
    }
    sort(steps.begin(), steps.end());
    cout << steps.size() << endl;
    for (int i=0; i<steps.size(); ++i) {
        switch (steps[i]) {
            case UL: cout << "UL"; break;
            case UR: cout << "UR"; break;
            case LL: cout << "LL"; break;
            case L: cout << "L"; break;
            case LR: cout << "LR"; break;
            case R: cout << "R"; break;
        }
        if (i < steps.size()-1)
            printf(" ");
    }
    printf("\n");
}

int main() {
    int n;
    cin >> n;
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}