#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) {
      char str[1000]="";  
     int c=0,x;
       //char s[44]="UL ";
       while(n--)
         {
             
             if(i_start>i_end && j_start >j_end)
                   strcat(str,"UL ");
             else if(i_start>i_end && j_start <j_end)
                   strcat(str,"LL ");             
             else if(i_start<i_end && j_start >j_end)
                   strcat(str, "UR ");
             else if(i_start<i_end &&  j_start<j_end)
                   strcat(str,"LR ");
             else if(i_start==i_end && j_start >j_end)
                   strcat(str,"L ");
                 else if(i_start==i_end && j_start <j_end)
                     strcat(str,"R ");
           c++;
         }
    if (i_start==i_end && j_start==j_end)
     printf("%d %s",c,str);
    else 
     printf ("Impossible");
    
    //  Print the distance along with the sequence of moves.
}

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