#include <bits/stdc++.h>
#define pii pair<int,int>
#define st first
#define nd second

using namespace std;
queue<pii> q;
string _move[7] = {"", "UL", "UR", "R", "LR", "LL", "L"};
int dx[6] = {-2, -2, 0, 2, 2, 0}, dy[6] = {-1, 1, 2, 1, -1, -2}, t[205][205], f[205][205];

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.
    q.push(make_pair(i_start, j_start));
    t[i_start][j_start] = 1;
    while(!q.empty()){
        int x = q.front().st, y = q.front().nd;
        //cout<<x<<" "<<y<<endl;
        q.pop();
        for(int i=0;i<6;i++){
            int tx = x+dx[i], ty = y+dy[i];
            
            if (tx < n && ty < n && tx >= 0 && ty >= 0 && t[tx][ty] == 0){
                //cout<<"goto "<<tx<<" "<<ty<<" step"<<t[x][y]+1<<endl;
                t[tx][ty] = t[x][y] + 1;
                q.push(make_pair(tx, ty));
                f[tx][ty] = i+1;
                if(tx == i_end && ty == j_end){
                    cout<<t[tx][ty]-1<<"\n";
                    stack<string> st;
                    int rx = tx, ry = ty;
                    //cout<<rx<<"?"<<ry<<endl;
                    //cout<<i_start<<"?"<<j_start<<endl;
                    while (rx != i_start || ry != j_start) {
                        //cout<<"rxry "<<rx<<" "<<ry<<endl;
                        st.push(_move[f[rx][ry]]);
                        int tmp = f[rx][ry]-1;
                        rx = rx - dx[tmp];
                        ry = ry - dy[tmp];
                    }
                    while(!st.empty()){
                        cout<<st.top()<<" ";
                        st.pop();
                    }
                    return;
                }
            }
        }
    }
    cout<<"Impossible";
}

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