#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
#define variableNumberOfElements 7
#define ID_LEN 2


int i_old,j_old;
int flag=0,count=0,min=100;

/*char **s;
s = malloc(7 * sizeof(char*));
for (int i = 0; i < 7; i++)
    s[i] = malloc(3 * sizeof(char));
char **path;

path = malloc(7 * sizeof(char*));
for (int i = 0; i < 7; i++)
    path[i] = malloc(3 * sizeof(char)); */
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end,int count,char **path,char **s) {
   
            
         
     while((i_start>=0)&&(i_start<n)&&(j_start>=0)&&(j_start<n))
     {
         
             
         
    if((i_start==i_old-2)&&(j_start=j_old-1))
        s[count]=strcpy(s[count],"UL");
     if((i_start==i_old-2)&&(j_start=j_old+1))
        s[count]=strcpy(s[count],"UR");
     if((i_start==i_old)&&(j_start=j_old+2))
        s[count]=strcpy(s[count],"R");
     if((i_start==i_old+2)&&(j_start=j_old+1))
        s[count]=strcpy(s[count],"LR");
     if((i_start==i_old+2)&&(j_start=j_old-1))
        s[count]=strcpy(s[count],"LL");
     if((i_start==i_old)&&(j_start=j_old-2))
        s[count]=strcpy(s[count],"L");
         
         
    
    
  
       
       
   
     if((i_start==i_end)&&(j_start==j_end)){
        
       flag=1;
         
             if(count<min){
             min=count;
        for(int k=0;k<min;k++)
        path[k]=strcpy(path[k],s[k]);
            }}
         
    else{i_old=i_start;
         j_old=j_start;
       printShortestPath(n,i_start-2,j_start-1,i_end,j_end,count+1,path,s);
         printShortestPath(n,i_start-2,j_start+1,i_end,j_end,count+1,path,s);
         printShortestPath(n,i_start,j_start+2,i_end,j_end,count+1,path,s);
         printShortestPath(n,i_start+2,j_start+1,i_end,j_end,count+1,path,s);
         printShortestPath(n,i_start+2,j_start-1,i_end,j_end,count+1,path,s);
         printShortestPath(n,i_start,j_start-2,i_end,j_end,count+1,path,s);
    
         }
   /* if(flag==0)
        printf("impossible");
    else
    {
       
    }*/
        
}
    
}

    

int main() {
    int n; 
    scanf("%i", &n);
    int i_start; 
    int j_start; 
    int i_end; 
    int j_end; 
    char **path;
path = malloc(variableNumberOfElements * sizeof(char*));  
for (int i = 0; i < variableNumberOfElements; i++)
    path[i] = malloc((ID_LEN+1) * sizeof(char));
       char **s;
s = malloc(variableNumberOfElements * sizeof(char*));
for (int i = 0; i < variableNumberOfElements; i++)
    s[i] = malloc((ID_LEN+1) * sizeof(char));   
    scanf("%i %i %i %i", &i_start, &j_start, &i_end, &j_end);
    i_old=i_start;
    j_old=j_start;
    
    printShortestPath(n, i_start, j_start, i_end, j_end,count,path,s);
    if(flag==1){
         printf("%d\n",min);
        for(int k=0;k<min;k++)
            printf("%s",path[k]);}
        
    else if(flag==0)
        printf("Impossible");
        
        
    
    return 0;
}