#include <bits/stdc++.h>
using namespace std;

int i_start;
int j_start;
int i_end;
int j_end;
int u,d,r,l;

void refresh(){
    u=0;d=0;r=0;l=0;
}

int next(int x, int y,int x2,int y2){
    int cas=0;
    
    if(x-x2>0){
        u=abs(x-x2);
        if(y-y2>0){
            l=abs(y-y2);
            cas=1;
        }
        else if(y-y2<0){
            r=abs(y-y2);
             cas=2;
        }
        else{
             cas=1;
        }
    }
    else if(x-x2<0){
        d=abs(x-x2);
        if(y-y2>0){
            l=abs(y-y2);
            cas=5;
        }
        else if(y-y2<0){
            r=abs(y-y2);
            cas=4;
        }
        else{
            cas=4;
        }
    }
    else if(x-x2==0){
        if(y-y2>0){
            l=abs(y-y2);
            cas=6;
        }
        else if(y-y2<0){
            r=abs(y-y2);
            cas=3;
        }
    }
    
    if(u==0 && d==0 && l==0 && r==0){
        cas=0;
        return cas;
    }
    
    if(u==0 && d==0){
        if(r==1||l==1){
            cas=-1;
        }
    }
    else if(r==0 && l==0){
        if(u==1||d==1){
             cas=-1;
        }
    }
    
    return cas;
}

void printShortestPath(int n, int x1, int y1, int x2, int y2) {
    
    int ar[n][n];
    
    vector< string > vec;
    
    while(true){
        //cout<<"("<<x1<<","<<y1<<")\n";
        int cas=next(x1,y1,x2,y2);
        //cout<<"case="<<cas<<endl;
        refresh();
        
        if(cas==-1){
            cout<<"Impossible";
            return;
        }
        else if(cas==0){
            //cout<<"\nFound!!\n";
            cout<<vec.size()<<endl;
            for(int i=0;i<vec.size();i++){
                cout<<vec[i]<<" ";
            }
            return;
        }
        else{
            switch(cas){
                case 1:{
                    x1-=2;
                    y1-=1;
                    //cout<<"\ncase 1\n";
                    vec.push_back("UL");
                    break;
                }
                case 2:{
                    x1-=2;
                    y1+=1;
                    vec.push_back("UR");
                    break;
                }
                case 3:{
                    y1+=2;              
                    vec.push_back("R");
                    break;
                }
                case 4:{
                    x1+=2;
                    y1+=1;
                    vec.push_back("LR");
                    break;
                }
                case 5:{
                    x1+=2;
                    y1-=1;                 
                    vec.push_back("LL");
                    break;
                }
                case 6:{
                    y1-=2;
                    vec.push_back("L");
                    break;
                }
                default:{                 
                    break;}
            }//end of switch
                
            }//end of else
        }//end of while
    }//end of function
    

int main() {
    int n;
    cin >> n;
    cin >> i_start >> j_start >> i_end >> j_end;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}