#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int js, int is, int je, int ie) {
    //  Print the distance along with the sequence of moves.
    //if(abs(js-je)%2!=0 || abs(is-ie)%2==0){
            //cout<<"Impossible\n";
            //return;}
    vector <string> s;
    int flag=0;
    //cout<<"INIT:  "<<is<<"  "<<js<<" "<<ie<<je<<endl;
    while(1){
        
        if(js>je&&is>ie){
            //cout<<"UL ";
            s.push_back("UL ");
            js-=2; is--;
        }
        
        else if(js>je&&is<ie){
            //cout<<"UR ";
            s.push_back("UR ");
            js-=2; is++;
        }
        else if(js==je&&is<ie){
            //cout<<"R ";
            s.push_back("R ");
            is+=2;
        }
        else if(js<je&&is<ie) {
              //cout<<"LR ";
              s.push_back("LR ");
              is++;js+=2;
        }
        else if(js<je&&is>ie){
            //cout<<"LL ";
            s.push_back("LL ");
            js+=2; is--;
        }
        else if(js==je&&is>ie){
            //cout<<"L ";
            s.push_back("L ");
            is-=2;
        }
       else if(is==ie&&js<je){
           //cout<<"LR";
           s.push_back("LR ");
              is++;js+=2;
       }
       else if(is==ie&&js>je){
           //cout<<"UL";
           s.push_back("UL ");
            js-=2; is--;
       }
        
         if(js==je&&is==ie)
            break;
       //cout<<is<<"  "<<js<<" ---> ";
       if(js>n||is>n||js<0||is<0){
           flag=1;break;
       }
 
    }
    
    
    if(flag==1)
        cout<<"Impossible";
    else{
        cout<<s.size()<<endl;
        for(int i=0;i<s.size();i++)
            cout<<s[i];
    }
    cout<<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;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}