#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i0, int j0, int in, int jn) {
    int flag=1;
    if(i0==in){
        if(abs(jn-j0)%2==0){
           cout<<abs(jn-j0)/2<<endl;
           if(jn>j0){
               int count=(jn-j0)/2;
               for(int i=0;i<count;i++){
                  if(i!=count-1)cout<<"R ";
                  else cout<<"R\n";
               }
           }
           if(jn<j0){
               int count=(j0-jn)/2;
               for(int i=0;i<count;i++){
                  if(i!=count-1)cout<<"L ";
                  else cout<<"L\n";
               }
           } 
        }
        else flag=0;
    }
    else if(j0==jn){
        if(abs(i0-in)%4==0){
             int count=abs(i0-in)/2;
               cout<<abs(i0-in)/2<<endl;
               for(int i=0;i<count;i++){
                  if(i%2==0){
                    if(i0>in)
                        cout<<"UR";
                    else
                        cout<<"LR";
                  }
                  else{                      
                    if(i0>in)
                        cout<<"UL";
                    else
                        cout<<"LL";
                  }
                  if(i!=(count-1))cout<<" ";
                  else cout<<"\n";
               }
        }
        else flag=0; 
    }
    else{
        int count1=0;
            if(abs(i0-in)%2==0){
                count1=abs(i0-in)/2;
                if(jn>j0)jn-=count1;
                else jn+=count1;
                if(abs(j0-jn)%2!=0)
                    flag=0;
                else cout<<count1+abs(j0-jn)/2<<endl;
                
            }
            else flag=0;
            if(flag==1){
                if(i0>in){//U
                    if(j0>jn){//UL
                        for(int i=0;i<count1;i++){
                            cout<<"UL ";
                        }
                    }
                    else{//UR
                        for(int i=0;i<count1;i++){
                            cout<<"UR ";
                        }
                    }
                }
                if(in>i0){//L
                    if(j0>jn){//LL
                        for(int i=0;i<count1;i++){
                            cout<<"LL ";
                        }
                    }
                    else{//LR
                        for(int i=0;i<count1;i++){
                            cout<<"LR ";
                        }
                    }
                }
                if(j0>jn){//L
                    if(abs(j0-jn)%2==0){
                        int count=abs(j0-jn)/2;
                        for(int i=0;i<count;i++){
                            if(i!=(count-1))cout<<"L ";
                            else cout<<"L\n";
                         }
                    }
                    else flag=0;
                }
                if(j0<jn){//R
                    if(abs(j0-jn)%2==0){
                        int count=abs(j0-jn)/2;
                        for(int i=0;i<=count;i++){
                            if(i!=(count-1))cout<<"R ";
                            else cout<<"R\n";
                         }
                    }
                    else flag=0;
                }
        }
    }
    if(flag==0)cout<<"Impossible\n";
}

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