#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 i,c=0,k=0;
    char str[1000000][4];
    if(i_start>i_end)
    {
        while(1){
        if((i_start==i_end)&&(j_start==j_end))
        {
            break;
        }
       else if((i_start-2>=0)&&(j_start-2>=0))
        {
            strcpy(str[k],"UL");
           k++;
            c++;
        }
        else if((i_start-2>=0)&&(j_start+1<n))
        {
            strcpy(str[k],"UR");
                k++;
            c++;
        }
        else if((i_start==i_end)&&(j_start<j_end))
        {
            strcpy(str[k],"R");
            k++;
            c++;
        }
        else if((i_start==i_end)&&(j_start>j_end))
        {
            strcpy(str[k],"L");
            k++;
            c++;
        }
        else
        {   
            printf("Impossible");
            exit(0);
        }
        }
    }
    else
    {     while(1){
        if((i_start==i_end)&&(j_start==j_end))
        {
            break;
        }
        else if((i_start+2>n)&&(j_start+1<n))
        {
            strcpy(str[k],"LR");
            k++;
            c++;
        }
        else if((i_start+2<n)&&(j_start-1>=0))
        {
            strcpy(str[k],"LL");
            k++;
            c++;
        }
        else if((i_start==i_end)&&(j_start<j_end))
        {
            strcpy(str[k++],"R");
            k++;
            c++;
        }
        else if((i_start==i_end)&&(j_start>j_end))
        {
            strcpy(str[k++],"L");
            k++;
            c++;
        }
        else
        {
            printf("Impossible");
            exit(0);
        }
    }
    }
    
    printf("%d\n",c);
    
    for(i=0;i<k;i++)
    {
        printf("%s\t",str[i]);
    }
        
}

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