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) {
        if(i_start % 2 == i_end % 2 || (Math.abs(j_end-j_start)%2 > 0)){
            StringBuilder builder = new StringBuilder(100);
            int minimumMoves = 0;
            
            int numberUps = Math.max((i_start - i_end)/2, 0);
            int numberDowns = Math.max((i_end - i_start)/2, 0);
            
            for(int i = 0; i < numberUps; i++){
                builder.append((j_start >= j_end) ? "UL " : "UR ");
                j_start += (j_start >= j_end) ? -1 : 1;
                i_start -= 2;
                minimumMoves++;
            }
            
            while(j_start < j_end){
               builder.append("R ");
               j_start += 2; 
               minimumMoves++;
            }
            
            for(int i = 0; i < numberDowns; i++){
                builder.append((j_start <= j_end) ? "LR " : "LL ");
                j_start += (j_start <= j_end) ? 1 : -1;
                i_start += 2;
                minimumMoves++;
            }
            
            while(j_start > j_end){
               builder.append("L ");
               j_start -= 2; 
               minimumMoves++;
            }
            
            System.out.println(minimumMoves);
            System.out.println(builder.toString().trim());
        }
        else{
            System.out.println("Impossible");
        }
    }

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