#include <bits/stdc++.h>

using namespace std;

int dy[6] = {-1, 1, 2, 1, -1, -2};
int dx[6] = {-2, -2, 0, 2, 2, 0};

string bfs(int n, vector<string> path, vector<vector<bool>>& flag, vector<int> vx, vector<int> vy, int i_end, int j_end){
    if(path.size() == 0)
        return "";
    vector<int> nextx;
    vector<int> nexty;
    vector<string> path2;
    for(int i = 0; i < path.size(); i++){
        int x = vx[i];
        int y = vy[i];
        //cout<<"Move " << path[i].size() <<" Now at ["<<x<<", "<<y<<"], next steps: "<< endl;
        for (int direction = 0;  direction < 6; direction++){
            string p = path[i] + std::to_string(direction);
            int newx = x + dx[direction];
            int newy = y + dy[direction];
            if(newx == i_end && newy==j_end){
                //cout<<"Arrived"<<endl; 
                return p;
            }
            if(newx >=0 && newy >=0 && newx < n && newy < n && !flag[newx][newy]){
                flag[newx][newy] = true;
                nextx.push_back(newx);
                nexty.push_back(newy);
                path2.push_back(p);
                //cout<<"    ->["<<newx <<", "<<newy<<"]" << p << endl;
            }
        }
    }
    return bfs(n, path2, flag, nextx, nexty, i_end, j_end);
}
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.

    vector<string> path;
    vector<vector<bool> > flag(n, vector<bool>(n, false));
    vector<int> vx;
    vector<int> vy;
    vx.push_back(i_start);
    vy.push_back(j_start);
    path.push_back("");
    flag[i_start][j_start] = true;
    string p = bfs(n, path, flag, vx, vy, i_end, j_end);
    //cout<<"p=" << p << endl;
    if(p=="")
        cout<<"Impossible"<<endl;
    else{
        cout<<p.size()<<endl;
        for(int i = 0; i < p.size(); i++){
            string str;
            if(p[i]=='0')
                str = "UL";
            else if (p[i] == '1')
                str = "UR";
            else if (p[i] == '2')
                str = "R";
            else if (p[i] == '3')
                str = "LR";
            else if (p[i] == '4')
                str = "LL";
            else if (p[i] == '5')
                str = "L";
            cout << str << " ";
        }
    }
    
    
}

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