#include <bits/stdc++.h>
#include <math.h>

using namespace std;

void printShortestPath(int n, int y_start, int x_start, int y_end, int x_end) {

    vector<string> x;

    //cout<<"Valor de x_start: "<<x_start<<endl;
    //cout<<"Valor de y_start: "<<y_start<<endl;
   //cout<<"Valor de x_end: "<<x_end<<endl;
    //cout<<"Valor de y_end: "<<y_end<<endl;
    int UL=0,UR=0,R=0,LR=0,LL=0,L=0;
    int vezes=0;
    bool possivelMover = true;
    bool realizouOperacao = false;

    while(possivelMover){
        //cout<<"Entrou while"<<endl;

        if(  y_start-2 >= y_end  ){

            if(  x_start >= x_end  ){
                y_start = y_start-2;
                x_start = x_start-1;
                UL++;
                realizouOperacao = true;
                vezes++;
                if(LR>0){
                    break;
                }
            }else if ( x_start <= x_end   ){
                y_start = y_start-2;
                x_start = x_start+1;
                UR++;
                realizouOperacao = true;
                vezes++;
                if(LL>0){
                    break;
                }
            }


        }else if( y_start == y_end && x_start < x_end ){
            x_start = x_start+2;
            R++;
            realizouOperacao = true;
            vezes++;
            if(L>0){
                break;
            }
        }else if( y_start+2  <= y_end ){

            if(x_start <= x_end){
                y_start = y_start+2;
                x_start = x_start+1;
                LR++;
                realizouOperacao = true;
                vezes++;
                if(UL>0){
                    break;
                }
            }else if(x_start >= x_end){
                y_start = y_start+2;
                x_start = x_start-1;
                LL++;
                realizouOperacao = true;
                vezes++;
                if(UR>0){
                    break;
                }
            }


        }else if( y_start == y_end && x_start > x_end     ){
            x_start = x_start-2;
            L++;
            realizouOperacao = true;
            vezes++;
            if(R>0){
                break;
            }
        }



        if( realizouOperacao == false ){
            possivelMover = false;
        }

        realizouOperacao = false;

    }


    if(x_end == x_start && y_end == y_start){
        cout<<vezes<<endl;

        if(UL>0){
            for(int j=0;j<UL;j++){
                x.push_back("UL");

            }
        }

        if(UR>0){
            for(int j=0;j<UR;j++){
                x.push_back("UR");

            }
        }

        if(R>0){
            for(int j=0;j<R;j++){
                x.push_back("R");

            }
        }

        if(LR>0){
            for(int j=0;j<LR;j++){
                x.push_back("LR");
            }
        }

        if(LL>0){
            for(int j=0;j<LL;j++){
                x.push_back("LL");

            }
        }

        if(L>0){
            for(int j=0;j<L;j++){
                x.push_back("L");
            }
        }

        for(int i = 0; i< x.size();i++){
                    if(i<x.size()-1){
                        cout<<x[i]<<" ";
                    }else{
                        cout<<x[i]<<endl;
                    }
                }


    }else{
        cout<<"Impossible"<<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;

    if( i_start >= n || j_start >= n || i_end >= n || j_end >= n  ){
        cout<<"Impossible"<<endl;
    }else if(i_start <0 || j_start <0 || i_end <0|| j_end <0){
        cout<<"Impossible"<<endl;
    }else if( abs( i_end - i_start)%2 ==0){
        printShortestPath(n, i_start, j_start, i_end, j_end);
    }else{
        cout<<"Impossible"<<endl;
    }

    return 0;
}