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-i_end)%2 != 0){
            System.out.println("Impossible");
            return;
        }
        
        StringBuffer solution_path = new StringBuffer("");
        int number_of_moves = 0;
        
        while(true){
 
            if(isEndPointSameRow(i_start,i_end) && isEndPointSameColumn(j_start,j_end)){
                printSolution(number_of_moves,solution_path.toString());
                return;
            }
            
            if(isEndPointSameRow(i_start,i_end)){
                
                if((j_start-j_end)%2 != 0){
                   System.out.println("Impossible");
                   return; 
                }
                
                int h_dist = j_start-j_end;
                String move = null;
                int sign;
                
                if(h_dist > 0){
                    move = "L ";
                    sign = -1;
                }else{
                    move = "R ";
                    sign = +1;
                }
                
                for(int i = 0; i < Math.abs(h_dist/2); i++){
                    number_of_moves++;
                    solution_path.append(move);
                    j_start += (sign*2);
                } 
            }else if(isEndPointSameColumn(j_start,j_end)){
                 
                if((i_start-i_end)%4 != 0){
                   System.out.println("Impossible");
                   return; 
                }
                
                int v_dist = i_start-i_end;
                String move = null;
                int sign;
                
                if(v_dist > 0){
                    move = "UL UR ";
                    sign = -1;
                }else{
                    move = "LR LL ";
                    sign = +1;
                }
                
                for(int i = 0; i < Math.abs(v_dist/4); i++){
                    number_of_moves += 2;
                    solution_path.append(move);
                    i_start += (sign*4);
                } 
                
            }else {
                
                if(i_start > i_end){
                    if(j_start > j_end){
                        number_of_moves++;
                        solution_path.append("UL ");
                        i_start += -2;
                        j_start += -1;
                    }else{
                        number_of_moves++;
                        solution_path.append("UR ");
                        i_start += -2;
                        j_start +=  1;
                    }
                }else{
                    if(j_start > j_end){
                        number_of_moves++;
                        solution_path.append("LL ");
                        i_start +=  2;
                        j_start += -1;
                    }else{
                        if((i_end-i_start)/2 == (j_end-j_start)){
                            number_of_moves++;
                            solution_path.append("LR ");
                            i_start += 2;
                            j_start += 1;   
                        }else{
                            number_of_moves++;
                            solution_path.append("R ");
                            j_start += 2;
                        }
                    }
                }
             
            }
        }
    }
    
    static boolean isEndPointSameRow(int i_start,int i_end){
        return i_start==i_end;
    }
    
    static boolean isEndPointSameColumn(int j_start,int j_end){
        return j_start==j_end;
    }
    
    static void printSolution(int number_of_moves,String solution_path){
        System.out.println(number_of_moves);
        System.out.println(solution_path);
    }

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