import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static 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 d = 0;
        if((i_start == i_end) && ((j_start - j_end)%2 == 0)){
            d = (j_start - j_end)/2;
            if(d>0){//left
                System.out.println(d);
                for(int k =0;k<d;k++){
                    System.out.print("L");
                    if(k!=d) System.out.print(" ");
                }
            }else{
                d = -1 * d;
                System.out.println(d);
                for(int k =0;k<d;k++){
                    System.out.print("R");
                    if(k!=d) System.out.print(" ");
                }
            }     
        }else if((j_start == j_end) && ((i_start - i_end)%4 == 0)){
            d = (i_start - i_end)/2;
           if(d>0){//up
               System.out.println(d);
                for(int k =0;k<d;k++){
                    if(k%2 == 0){
                        System.out.print("UR");
                    }else{
                        System.out.print("UL");
                    }
                    if(k!=d) System.out.print(" ");
                }
            }else{
               d = -1 * d;
                System.out.println(d);
                for(int k =0;k<d;k++){
                    if(k%2 == 0){
                        System.out.print("LR");
                    }else{
                        System.out.print("LL");
                    }
                    
                    if(k!=d) System.out.print(" ");
                }
            }    
        }
        
        
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int i_start = in.nextInt();
        int j_start = in.nextInt();
        int i_end = in.nextInt();
        int j_end = in.nextInt();
        printShortestPath(n, i_start, j_start, i_end, j_end);
        in.close();
    }
}