#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) {
     if(i_start == i_end){
         if(j_start < j_end){ // Right
             int sub = j_end - j_start;
             if(sub%2==0){ //right
                 printf("%d\n",sub/2);
                 int i;
                 for(i=0;i<sub/2;i++){
                     printf("R ");
                 }
             }
             else{
                 printf("Impossible");
             }
         }
         else{
             int sub = j_start - j_end;
             if(sub%2==0){ // left
                 printf("%d\n",sub/2);
                 int i;
                 for(i=0;i<sub/2;i++){
                     printf("L ");
                 }
             }
             else{
                 printf("Impossible");
             }
         }
    }                              //completed
    //--------------------------------------------------------------------------------------------------------
    else if(j_start == j_end){
        if(i_start > i_end){
            int sub = i_start - i_end;
             if(sub%2==0){   //upper
                 printf("%d\n",sub/2);
                 int i;
                 for(i=0;i<sub/2;i++){
                     printf("U ");
                 }
             }
             else{
                 printf("Impossible");
             }
        }
        else{        //down
            int sub = i_end - i_start;
             if(sub%2==0){
                 printf("%d\n",sub/2);
                 int i;
                 for(i=0;i<sub/2;i++){
                     printf("L ");
                 }
             }
             else{
                 printf("Impossible");
             }
        }
    }
    //--------------------------------------------------------------------------------------------------------------------
    else{
        if(i_start > i_end){
            int sub = i_start - i_end,count=0,i;
            if(sub % 2 == 0){
                count += sub / 2;
                if(j_start < j_end){
                    sub = j_end - (j_start+count);
                    if(sub % 2 == 0){
                        int temp=count;
                        count += sub / 2;
                        printf("%d\n",count);
                        for(i=0;i<temp;i++)
                            printf("UR ");
                        for(i=temp;i<count;i++)
                            printf("R");
                    }
                    else{
                        printf("Impossible");
                    }
                }
                else{
                    sub = j_start - (j_end+count);
                    if(sub % 2 == 0){
                        int temp = count;
                        count += sub / 2;
                        printf("%d\n",count);
                        for(i=0;i<temp;i++)
                            printf("UL ");
                        for(i=temp;i<count;i++)
                            printf("L");
                    }
                    else{
                        printf("Impossible");
                    }
                }
            }
            else{   //upper impossible
                printf("Impossible");
            }
        }
        else{
            int sub = i_end - i_start,count=0,i;
            //printf("d=%d",sub);
            if(sub % 2 == 0){
                count += sub / 2;
                if(j_start < j_end){//down and Right
                    sub = j_end - (j_start+count);
                    if(sub % 2 == 0){
                        int temp = count;
                        count += sub / 2;
                        printf("%d\n",count);
                        for(i=temp;i<count;i++)
                            printf("R ");
                        for(i=0;i<temp;i++)
                            printf("LR ");
                    }
                    else{
                        printf("Impossible");
                    }
                }
                else{ //down and left
                    sub = j_start - (j_end+count);
                    if(sub % 2 == 0){
                        int temp = count;
                        count += sub / 2;
                        printf("%d\n",count);
                        for(i=0;i<temp;i++)
                            printf("LL ");
                        for(i=temp;i<count;i++)
                            printf("L");
                    }
                    else{
                        printf("Impossible");
                    }
                }
            }
            else{
                printf("Impossible");
            }
            
        }
    }
}

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