#include <bits/stdc++.h>

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.
    if(i_start%2!=i_end%2){
        cout<< "Impossible";
    }else if(i_start%4==i_end%4?j_start%2!=j_end%2:j_start%2==j_end%2){
        cout<< "Impossible";
    }else{
        bool running = true;
        vector<string> moves;
        while((i_start!=i_end||j_start!=j_end)&&running){
            if(i_start>i_end){ // Up
                if(j_start>j_end){ //Up Left
                    j_start-=1;
                    i_start-=2;
                    moves.push_back("UL");
                }else if(j_start<j_end){ // Up Right 
                    j_start+=1;
                    i_start-=2;
                    moves.push_back("UR");
                }else{ // straight up -> Up left or up right (considering walls)
                    if(j_start>0){ // Up left
                        j_start-=1;
                        i_start-=2;
                        moves.push_back("UL");
                    }else if(j_start<n){ // Up right
                        j_start+=1;
                        i_start-=2;
                        moves.push_back("UR");
                    }else{
                        cout<< "Impossible";
                        running = false;
                    }
                }
            }else if(i_start<i_end){ // Down
                if(j_start>j_end){ // Down Left
                    j_start-=1;
                    i_start+=2;
                    moves.push_back("LL");
                } else if(j_start<j_end){ // Down Right
                    j_start+=1;
                    i_start+=2;
                    moves.push_back("LR");
                }else{ // Down
                    if(j_start<n){ // Down right
                        j_start+=1;
                        i_start+=2;
                        moves.push_back("LR");
                    }else if(j_start>0){ // Down left
                        j_start-=1;
                        i_start+=2;
                        moves.push_back("LL");
                    }else{
                        cout<<"Impossible";
                        running == false;
                    }
                }
            }else{ //Stay level
                if(j_start<j_end){ // Right
                    j_start+=2;
                    moves.push_back("R");
                }else{
                    j_start-=2;
                    moves.push_back("L");
                }
            }
            
        }
        if(running){ // Print solution
            cout<< moves.size() << endl;
            for(int i = 0;i<moves.size();i++)
                cout<< moves[i] << " ";
        } // Else there was no solution, and "Impossible" was already printed.
    }
}

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