#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    int dy= i_end-i_start;
    int dx= j_end - j_start; 
    if((dy)%2!=0){
        cout << "Impossible" << endl;
        return ;
    }
    {
        if(dy==0){
            if(dx%2!=0){
                cout << "Impossible"<< endl;
                return ;
            }
            if(dx==0){
                cout << 0 << endl;
                return ;
            }
            if(dx>0){
                cout << dx/2<< endl;
                for(int i=0; i<dx/2; i++){
                    cout << "R";
                    if(i!=(dx/2)-1){
                        cout<<" ";
                    }
                }
                return;
            }
            if(dx<0){
                dx=dx*(-1);
                cout << dx/2 << endl;
                for(int i=0; i<dx/2; i++){
                    cout << "L";
                    if(i!=(dx/2)-1){
                        cout<<" ";
                    }
                }
                return;
            }
        }


    }


    //  Print the distance along with the sequence of moves.
}

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