#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>

using namespace std;

long minMoves(vector<vector<int>> &grid, vector<vector<string>> &moveList, int i, int j, int x, int y, int endi, int endj) {

    queue<pair<int,int>> q;

    q.push(pair<int,int>(i,j));

    while(!q.empty()) {
        pair<int,int> p = q.front();
        q.pop();

        int x1 = p.first;
        int x2 = p.second;

        if (x2-1 >= 0 && x1-2 >= 0 && grid[x1-2][x2-1] == -1) {
            grid[x1-2][x2-1] = grid[x1][x2] + 1;
            moveList[x1-2][x2-1] = moveList[x1][x2] + "UL ";
            q.push(pair<int,int>(x1-2, x2-1));
        }

        if (x2+1 < y && x1-2 >= 0 && grid[x1-2][x2+1] == -1) {
            grid[x1-2][x2+1] = grid[x1][x2] + 1;
            moveList[x1-2][x2+1] = moveList[x1][x2] + "UR ";
            q.push(pair<int,int>(x1-2, x2+1));
        }

        if (x2+2 < y && grid[x1][x2+2] == -1) {
            grid[x1][x2+2] = grid[x1][x2] + 1;
            moveList[x1][x2+2] = moveList[x1][x2] + "R ";
            q.push(pair<int,int>(x1, x2+2));
        }

        if (x2+1 < y && x1+2 < x && grid[x1+2][x2+1] == -1) {
            grid[x1+2][x2+1] = grid[x1][x2] + 1;
            moveList[x1+2][x2+1] = moveList[x1][x2] + "LR ";
            q.push(pair<int,int>(x1+2, x2+1));
        }

        if (x2-1 >= 0 &&  x1+2 < x && grid[x1+2][x2-1] == -1) {
            grid[x1+2][x2-1] = grid[x1][x2] + 1;
            moveList[x1+2][x2-1] = moveList[x1][x2] + "LL ";
            q.push(pair<int,int>(x1+2, x2-1));
        }

        if (x2-2 >= 0 && grid[x1][x2-2] == -1) {
            grid[x1][x2-2] = grid[x1][x2] + 1;
            moveList[x1][x2-2] = moveList[x1][x2] + "L ";
            q.push(pair<int,int>(x1, x2-2));
        }
    }

    return grid[endi][endj];

}

int main() {

    int n;
    scanf("%d", &n);

    int starti, startj, endi, endj;

    scanf("%d %d %d %d", &starti, &startj, &endi, &endj);

    vector<vector<int>> grid(n, vector<int>(n, -1));
    vector<vector<string>> moveList(n, vector<string>(n, ""));

    grid[starti][startj] = 0;

    long moves = minMoves(grid, moveList, starti, startj, n,n,endi,endj);

//    for (int i = 0; i < n; i++) {
//
//        for (int j = 0; j < n; j++) {
//            cout << grid[i][j] << " ";
//        }
//        cout << endl;
//
//    }
//
//    cout << endl;

    if (moves == -1) {
        cout << "Impossible" << endl;
    } else {
        cout << moves << endl;
        cout << moveList[endi][endj] << endl;
    }
}