#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 i1, int j1, int i2, int j2) {
    //  Print the distance along with the sequence of moves.
    int count=0;
    if(i2!=i1||j2!=j1){
    if(i2<i1&&j2<j1){
        i1=(i1)-1;
        j1=(j1)-2;
        count++;
        printf("UL ");
    }
    if(i2>i1&&j2<j1){
        i1=(i1)+1;
        j1=(j1)-2;
        count++;
        printf("UR ");
    }
   if(j1==j2&&i2==((i1)+2)){
       i1=(i1)+2;
       count++;
       printf("R ");
   } 
    if(i2>i1&&j2>j1){
        i1=(i1)+1;
        j1=(j1)+2;
        count++;
        printf("LR ");
    }
    if(i2<i1&&j2>j1){
        i1=(i1)-1;
        j1=(j1)+2;
        count++;
        printf("LL ");
    }
    if(j1==j2&&i2==((i1)-2)){
        i1=(i1)-2;
        count++;
        printf("L ");
    }
    }
    if(i1==i2&&j1==j2){
        printf("%d",count);
    }
}

int main() {
    int n; 
    scanf("%i", &n);
    int i1; 
    int j1; 
    int i2; 
    int j2; 
    scanf("%i %i %i %i", &i1, &j1, &i2, &j2);
    printShortestPath(n, i1, j1, i2, j2);
    return 0;
}