#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_end>n || j_end>n) {
        cout<<"Impossible";
    }
    else if(abs(j_end-j_start)%2!=0) {
        cout<<"Impossible";
    }
    else if(i_start == i_end) {
        if(abs(j_end-j_start)%4!=0) {
            cout<<"Impossible";
        }
        else {
            cout<<abs(j_end-j_start)/2<<endl;
            if(j_end>j_start) {
                for(int i=0;i<abs(j_end-j_start)/4;i++) {
                    cout<<"LR ";
                }
                for(int i=0;i<abs(j_end-j_start)/4;i++) {
                    cout<<"LL ";
                }
            }
            else {
                for(int i=0;i<abs(j_end-j_start)/4;i++) {
                    cout<<"UL ";
                }
                for(int i=0;i<abs(j_end-j_start)/4;i++) {
                    cout<<"UR ";
                }
            }
        }
    }
    else if(j_start == j_end) {
        if(abs(i_start-i_end)%2==0) {
            cout<<abs(i_start-i_end)/2<<endl;
            if(i_start<i_end) {
                for(int i=0;i<abs(i_start-i_end)/2;i++)
                    cout<<"L ";
            }
            else {
                for(int i=0;i<abs(i_start-i_end)/2;i++)
                    cout<<"R ";
            }
        }
        else {
            cout<<"Impossible";
        }
    }
    else {
        int j = abs(j_start-j_end);
        int i = abs(i_start-i_end);
        if(j_start<j_end) {
            //first quad
            if(i_start<i_end) {
                
                if((j%4==0 && i%2==0) || (j%4!=0 && i%2!=0)) {
                    if(j/4>i/2) {
                        int j1 = 2*i;
                        cout<<i+abs(j_end-j1)/2<<endl;
                        for(int i1=0;i1<abs(j_end-j1)/4;i1++) {
                            cout<<"LR ";
                        }
                        for(int i1=0;i1<abs(j_end-j1)/4;i1++) {
                            cout<<"LL ";
                        }    
                        for(int i1=0;i1<i;i1++) {
                            cout<<"LL ";
                        }
                    }
                    else {
                        int j1 = j/2;
                        cout<<j1+(i-j1)/2<<endl;
                        for(int i1=0;i1<j/2;i1++) {
                            cout<<"LL ";
                        }
                        for(int i1=j1;i1<i;i1+=2) {
                            cout<<"L ";
                        }
                    }
                }
                else {
                    cout<<"Impossible";
                }
                
                
                
                
            }
            //second quad
            else {
                
                
                
                if((j%4==0 && i%2==0) || (j%4!=0 && i%2!=0)) {
                    if(j/4>i/2) {
                        int j1 = 2*i;
                        cout<<i+abs(j_end-j1)/2<<endl;
                        for(int i1=0;i1<i;i1++) {
                            cout<<"LR ";
                        }
                        for(int i1=0;i1<abs(j_end-j1)/4;i1++) {
                            cout<<"LR ";
                        }
                        for(int i1=0;i1<abs(j_end-j1)/4;i1++) {
                            cout<<"LL ";
                        }    
                    }
                    else {
                        int j1 = j/2;
                        cout<<j1+(i-j1)/2<<endl;
                        for(int i1=j1;i1<i;i1+=2) {
                            cout<<"R ";
                        }
                        for(int i1=0;i1<j/2;i1++) {
                            cout<<"LR ";
                        }
                        
                    }
                }
                else {
                    cout<<"Impossible";
                }
                
                
                
                
                
            }
        }
        else {
            //third quad
            if(i_start<i_end) {
                
                
                
                
                if((j%4==0 && i%2==0) || (j%4!=0 && i%2!=0)) {
                    if(j/4>i/2) {
                        int j1 = 2*i;
                        cout<<i+abs(j_end-j1)/2<<endl;
                        for(int i1=0;i1<i;i1++) {
                            cout<<"UL ";
                        }
                        for(int i1=0;i1<abs(j_end-j1)/4;i1++) {
                            cout<<"UL ";
                        }
                        for(int i1=0;i1<abs(j_end-j1)/4;i1++) {
                            cout<<"UR ";
                        }    
                    }
                    else {
                        int j1 = j/2;
                        cout<<j1+(i-j1)/2<<endl;
                        for(int i1=0;i1<j/2;i1++) {
                            cout<<"UL ";
                        }
                        for(int i1=j1;i1<i;i1+=2) {
                            cout<<"L ";
                        }
                    }
                }
                else {
                    cout<<"Impossible";
                }
                
            }
            //fourth quad
            else {
                
                
                
                
                if((j%4==0 && i%2==0) || (j%4!=0 && i%2!=0)) {
                    if(j/4>i/2) {
                        int j1 = 2*i;
                        cout<<i+abs(j_end-j1)/2<<endl;
                        for(int i1=0;i1<abs(j_end-j1)/4;i1++) {
                            cout<<"UL ";
                        }
                        for(int i1=0;i1<abs(j_end-j1)/4;i1++) {
                            cout<<"UR ";
                        }    
                        for(int i1=0;i1<i;i1++) {
                            cout<<"UR ";
                        }
                    }
                    else {
                        int j1 = j/2;
                        cout<<j1+(i-j1)/2<<endl;
                        for(int i1=0;i1<j/2;i1++) {
                            cout<<"UR ";
                        }
                        for(int i1=j1;i1<i;i1+=2) {
                            cout<<"R ";
                        }
                    }
                }
                else {
                    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, 0, 0, j_start-j_end ,i_end-i_start);
    return 0;
}