#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int is, int js, int ie, int je) {
    vector<string>s;
    int c=0,flag=0;
    while(is>=0&&js>=0&&is<n&&js<n){
        if(ie>is&&je>js){
            if(is+2==ie&&js+1<je){
                c++;s.push_back("R");
                  js=js+2;
            }
            else{
            c++;s.push_back("LR");
            is=is+2;
            js=js+1;
            }
        }
        else if(ie<is&&je>js){
            c++;s.push_back("UR");
            is=is-2;
            js=js+1;
        }
        else if(ie>is&&je<js){
            c++;s.push_back("LL");
            is=is+2;
            js=js-1;
        }
        else if(ie<is&&je<js){
            c++;s.push_back("UL");
            is=is-2;
            js=js-1;
        }
        else if(ie==is&&je>js){
            int x=je-js;
            if(x%2==0){
            c++;s.push_back("R");
            js=js+2;
            }
            else{
                break;
            }
        }
        else if(ie==is&&je<js){
            int x=js-je;
            if(x%2==0){
            c++;s.push_back("L");
            js=js-2;
            }
            else{
                break;
            }
        }
        else if(ie==is&&je==js){
            flag=1;
            break;
        }
        else if(ie!=is&&je==js){
            int x=ie-is,t1,t2;
                x=abs(x);
                t1=x;
                t1=t1/4;
                t2=t1;
            if(ie>is&&x%4==0){
                while(t1>0){
                c++;s.push_back("LR");
                is=is+2;
                js=js+1; 
                    t1--;
                }
                while(t2>0){
                c++;s.push_back("LL");
                is=is+2;
                js=js-1; 
                    t2--;
                }
            }
            else if(ie<is&&x%4==0){
                while(t1>0){
                c++;s.push_back("UL");
                  is=is-2;
                  js=js-1;
                    t1--;
                }
                 while(t2>0){
                 c++;s.push_back("UR");
                  is=is-2;
                  js=js+1;
                     t2--;
                }
            }
            else{
                break;
            }
        }
    }
    if(flag==1){
        cout<<c<<endl;
        for(int i=0;i<s.size();i++){
            cout<<s[i]<<" ";
        }
    }
    else{
        cout<<"Impossible";
    }
    //  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;
}