#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.
    int move=0,s;
    vector<string>v;
    int i=i_start,j=j_start,k=i_end,l=j_end;
    if(i==k){
        if(abs(l-j)==2){
            if(j<l){
                move++;
                v.push_back("R");
                s=v.size();
                cout<<move<<endl;
                for(i=0;i<s;i++)
                    cout<<v[i]<<" ";
                return;
            }
            else{
                move++;
                v.push_back("L");
                s=v.size();
                cout<<move<<endl;
                for(i=0;i<s;i++)
                    cout<<v[i]<<" ";
                return;
            }
        }
        else{
           cout<<"Impossible";
            return;
        } 
    }
    if(i<k){
        while((i+2)<k){
            i=i+2;
            if(i==k && (j-1)==l){
                move++;
                v.push_back("LL");
                s=v.size();
                cout<<move<<endl;
                for(i=0;i<s;i++)
                    cout<<v[i]<<" ";
                return;
            }
            else if(i==k && (j+1)==l){
                move++;
                v.push_back("LR");
                s=v.size();
                cout<<move<<endl;
                for(i=0;i<s;i++)
                    cout<<v[i]<<" ";
                return;
            }
            else{
                j=j+1;
                move++;
                v.push_back("LR");
            }
        }

        if((i+2)==k){
            i=i+2;
            if(j+1==l){
                move++;
                v.push_back("LR");
                s=v.size();
                cout<<move<<endl;
                for(i=0;i<s;i++)
                    cout<<v[i]<<" ";
                return;
            }
            if(j-1==l){
                 move++;
                 v.push_back("LL");
                s=v.size();
                cout<<move<<endl;
                for(i=0;i<s;i++)
                    cout<<v[i]<<" ";
                return;
            }
            else{
                 j=j+1;
                 move++;
                v.push_back("LR");
            }
        }
          if(i==k){
            if(abs(j-l)==2){
            if(j<l){
                move++;
                v.push_back("R");
                s=v.size();
                cout<<move<<endl;
                for(i=0;i<s;i++)
                    cout<<v[i]<<" ";
                return;
            }
            else{
                move++;
                v.push_back("L");
                s=v.size();
                cout<<move<<endl;
                for(i=0;i<s;i++)
                    cout<<v[i]<<" ";
                return;
                }
            }
        else{
           cout<<"Impossible";
            return;
        } 
       }
        else{
                cout<<"Impossible";
                return;
            }
    }
    else{
        while((i-2)>k){
            i=i-2;
            if(i==k && (j-1)==l){
                move++;
                v.push_back("UL");
                s=v.size();
                cout<<move<<endl;
                for(i=0;i<s;i++)
                    cout<<v[i]<<" ";
                return;
            }
            else if(i==k && (j+1)==l){
                move++;
                v.push_back("UR");
                s=v.size();
                cout<<move<<endl;
                for(i=0;i<s;i++)
                    cout<<v[i]<<" ";
                return;
            }
            else{
                j=j-1;
                move++;
                v.push_back("UL");
            }
        }

        if((i-2)==k){
            i=i-2;
            if(j+1==l){
                move++;
                v.push_back("UR");
                s=v.size();
                cout<<move<<endl;
                for(i=0;i<s;i++)
                    cout<<v[i]<<" ";
                return;
            }
            if(j-1==l){
                 move++;
                 v.push_back("UL");
                s=v.size();
                cout<<move<<endl;
                for(i=0;i<s;i++)
                    cout<<v[i]<<" ";
                return;
            }
            else{
               j=j-1;
               move++;
                v.push_back("UL");
            }
        }
           if(i==k){
            if(abs(l-j)==2){
            if(j<l){
                move++;
                v.push_back("R");
                s=v.size();
                cout<<move<<endl;
                for(i=0;i<s;i++)
                    cout<<v[i]<<" ";
                return;
            }
            else{
                move++;
                v.push_back("L");
                s=v.size();
                cout<<move<<endl;
                for(i=0;i<s;i++)
                    cout<<v[i]<<" ";
                return;
            }
        }
        else{
           cout<<"Impossible";
            return;
        } 
       }
        else{
            cout<<"Impossible";
            return;
        }
    }
    
}

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