#include <bits/stdc++.h>

using namespace std;

bool check(int n, vector<vector<int>> &v, 
           int r, int c, int step) 
{
    if (r < 0 || c < 0 || r >= n || c >= n || v[r][c] == 0 ||
       v[r][c] >= step)
        return false;
    return true;
}

void rec(vector<vector<string>> &sv, int i, int j, int i_start, int j_start) {
    if (i == i_start && j == j_start)
        return;
    
    if (sv[i][j] == "UL") {
        rec(sv, i+2, j+1, i_start, j_start);
        cout << "UL" << ' ';
    } else if (sv[i][j] == "UR") {
        rec(sv, i+2, j-1, i_start, j_start);
        cout << "UR" << ' ';
    } else if (sv[i][j] == "R") {
        rec(sv, i, j-2, i_start, j_start);
        cout << "R" << ' ';
    } else if (sv[i][j] == "LR") {
        rec(sv, i-2, j-1, i_start, j_start);
        cout << "LR" << ' ';
    } else if (sv[i][j] == "LL") {
        rec(sv, i-2, j+1, i_start, j_start);
        cout << "LL" << ' ';
    } else if (sv[i][j] == "L") {
        rec(sv, i, j+2, i_start, j_start);
        cout << "L" << ' ';
    }
}

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.
    bool exit = false;
    string s = "";
    
    vector<vector<int>> v(n, vector<int>(n, 0));
    vector<vector<string>> sv(n, vector<string>(n));
    
    v[i_start][j_start] = 1;
    
    while (!exit) {
        vector<vector<int>> curV = v;
        exit = true;
        for (int i=0; i<n; i++) {
            for (int j=0; j<n; j++) {
                if (v[i][j])
                    continue;
                
                int step = 0x7FFFFFFF;
                
                if (check(n, v, i+2, j+1, step)) {
                    step = v[i+2][j+1] + 1;
                    sv[i][j] = "UL";
                }
                
                if (check(n, v, i+2, j-1, step)) {
                    step = v[i+2][j-1] + 1;
                    sv[i][j] = "UR";
                }
                
                if (check(n, v, i, j-2, step)) {
                    step = v[i][j-2] + 1;
                    sv[i][j] = "R";
                }
                
                if (check(n, v, i-2, j-1, step)) {
                    step = v[i-2][j-1] + 1;
                    sv[i][j] = "LR";
                }
                
                if (check(n, v, i-2, j+1, step)) {
                    step = v[i-2][j+1] + 1;
                    sv[i][j] = "LL";
                }
                
                if (check(n, v, i, j+2, step)) {
                    step = v[i][j+2] + 1;
                    sv[i][j] = "L";
                }
                
                if (step < 0x7fffffff) {
                    curV[i][j] = step;
                    
                    if (i != i_end || j != j_end) {
                        exit = false;
                    } else {
                        i = n;
                        j = n;
                    }
                }     
            }
        }
        v = curV;
    }
end:
    
    if (v[i_end][j_end] - 1 < 0) {
        cout << "Impossible" << endl;
    } else {
        cout << v[i_end][j_end] - 1 << endl;
        rec(sv, i_end, j_end, i_start, j_start);
        cout << endl;
    }
    
}

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;
}