#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

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 type[n][n],i,j;
    for(i=0;i<n;i=i+4){
        for(j=0;j<n;j=j+2){
            type[i][j]=1;
        }
    }
     for(i=2;i<n;i=i+4){
        for(j=1;j<n;j=j+2){
            type[i][j]=1;
        }
    }
    
     for(i=0;i<n;i=i+4){
        for(j=1;j<n;j=j+2){
            type[i][j]=2;
        }
    }
     for(i=2;i<n;i=i+4){
        for(j=0;j<n;j=j+2){
            type[i][j]=2;
        }
    }
    
     for(i=1;i<n;i=i+4){
        for(j=0;j<n;j=j+2){
            type[i][j]=3;
        }
    }
    for(i=3;i<n;i=i+4){
        for(j=1;j<n;j=j+2){
            type[i][j]=3;
        }
    }
    
     for(i=1;i<n;i=i+4){
        for(j=1;j<n;j=j+2){
            type[i][j]=4;
        }
    }
    for(i=3;i<n;i=i+4){
        for(j=0;j<n;j=j+2){
            type[i][j]=4;
        }
    }
    if(type[i_start][j_start] != type[i_end][j_end])
        printf("Impossible");
    else{
        int count=0,UL=0,UR=0,R=0,L=0,LR=0,LL=0;
        i=i_start;
        j=j_start;
            if(i_start>i_end)
        {
            while(i>i_end && j_end<j)
            {
               UL++;
               i=i-2;
               j=j-1; 
                  
            }

            while(i>i_end && j_end>j)
            {
               UR++;
               i=i-2;
               j=j+1  ;   
            }
            if(j_end>j){
                while(j!=j_end){
                    R++;
                    j=j+2;
                }
            }
            else if(j_end<j){
                 while(j!=j_end){
                    L++;
                    j=j-2;
                }
            }
        }
        else if(i_start<i_end)
        {
             while(i<i_end && j_end<j)
            {
               LL++;
               i=i+2;
               j=j-1;     
            }

            while(i<i_end && j_end>j)
            {
               LR++;
               i=i+2;
               j=j+1;     
            }
            if(j_end>j){
                while(j!=j_end){
                    R++;
                    j=j+2;
                }
            }
            else if(j_end<j){
                 while(j!=j_end){
                    L++;
                    j=j-2;
                }
            }
        }
        else if(i_start==i_end)
        {
            if(j_end>j){
                while(j!=j_end){
                    R++;
                    j=j+2;
                }
            }
            else if(j_end<j){
                 while(j!=j_end){
                    L++;
                    j=j-2;
                }
            }
        }
        count= UL+UR+R+L+LL+LR;
        printf("%d\n",count);

        //PRINTING THE WAYS
        while(UL>0){
            printf("UL ");
            UL--;
        }
        while(UR>0){
            printf("UR ");
            UR--;
        }
        while(R>0){
            printf("R ");
            R--;
        }
        while(LR>0){
            printf("LR ");
            LR--;
        }
        while(LL>0){
            printf("LL ");
            LL--;
        }
        while(L>0){
            printf("L ");
            L--;
        }

    }
}

int main() {
    int n; 
    scanf("%i", &n);
    int i_start; 
    int j_start; 
    int i_end; 
    int j_end; 
    scanf("%i %i %i %i", &i_start, &j_start, &i_end, &j_end);
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}