#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 is, int js, int ie, int je) {
    //  Print the distance along with the sequence of moves.
     int c1=0,c2=0,c3=0,c4=0,a1=0,a2=0,a3=0,a4=0;
    if(ie<=is && je<=js){
        while(ie!=is && je!=js && (0<=is,js,ie,je<=n-1)){
            is=is-2;
            js=js-1;
            c1++;}
         while(ie==is && je!=js && (0<=is,js,ie,je<=n-1)){
             js=js-2;
             a1++;}
         if(ie==is&&je==js){
        printf("%d\n",c1+a1);
        while(c1!=0){
        printf("UL ");
        c1--;}
        while(a1!=0){
            printf("L");
            a1--;
        }}
         else printf("Impossible");
            
        
    }
    else if(ie>=is && je<=js  ){
         while(ie!=is && je!=js && (0<=is,js,ie,je<=n-1)){
            is=is+2;
            js=js-1;
            c2++;}
         while(ie==is && je!=js && (0<=is,js,ie,je<=n-1)){
             js=js-2;
             a2++;}
         if(ie==is&&je==js){
        printf("%d\n",c2+a2);
        while(c2!=0){
        printf("LL ");
        c2--;}
        while(a2!=0){
            printf("L");
            a2--;
        }}
         else printf("Impossible");
       
    }
    else if(ie<=is && je>=js ){
         while(ie!=is && je!=js && (0<=is-2,js+1,ie,je<=n-1)){
            is=is-2;
            js=js+1;
            c3++;}
        if(ie==is){ 
         while(ie==is && je!=js && (0<=is,js+2,ie,je<=n-1)){
             js=js+2;
             a3++;}}
        if(ie==is&&je==js){ 
        printf("%d\n",c3+a3);
        while(c3!=0){
        printf("UR ");
        c3--;}
        while(a3!=0){
            printf("R");
            a3--;
        } }
         else printf("Impossible");

       
    }
    else if(ie>=is && je>=js){
         while(ie!=is && je!=js && (0<=is,js,ie,je<=n-1)){
            is=is+2;
            js=js+1;
            c4++;}
         while(ie==is && je!=js && (0<=is,js,ie,je<=n-1)){
             js=js+2;
             a4++;}
         if(ie==is&&je==js){
        printf("%d\n",c4+a4);
        while(c4!=0){
        printf("LR ");
        c4--;}
        while(a4!=0){
            printf("R");
            a4--;
        }}
         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;
}