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(Math.abs(i_start - i_end)%2 == 1){
            System.out.println("Impossible");
        }else if((Math.abs(i_start - i_end)/2 + Math.abs(j_start - j_end))%2 == 1){
            System.out.println("Impossible");
        }else{
            int steps = 0;
            int vshift = Math.abs(i_start-i_end)/2;
            int hdiff  = Math.abs(j_start - j_end);
            int hshift = Math.max((hdiff - vshift)/2, 0);
            steps = vshift + hshift;
            String[] results= new String[steps];
            System.out.println(steps);
            //from right lower to left upper
            int step1 = 0;
            int step2 = 0;
            if(j_start>j_end && i_start>i_end){
                if(hdiff<vshift){
                    step1 = hdiff + (vshift-hdiff)/2;
                    for(int i = 0; i<step1; i++){
                        results[i] = " UL";
                    }
                    
                    for(int i = step1; i < steps; i++){
                        results[i] = " UR";
                    }
                    results[0] = "UL";
                }else if(hdiff==vshift){
                    for(int i = 0; i<steps; i++){
                    results[i] = " UL";   
                    }
                    results[0] = "UL";
                }else if(hdiff>vshift){
                    step1 = vshift;
                    for(int i = 0; i<step1; i++){
                        results[i] = " UL";
                    }
                    
                    for(int i = step1; i < steps; i++){
                        results[i] = " L";
                    }
                    results[0] = "UL";                    
                }
                
            }
                else if(j_start<j_end && i_start>i_end){
                if(hdiff<vshift){
                    step1 = (vshift+hdiff)/2 - hdiff;
                    for(int i = 0; i<step1; i++){
                        results[i] = " UL";
                    }
                    
                    for(int i = step1; i < steps; i++){
                        results[i] = " UR";
                    }
                    results[0] = "UL";
                }else if(hdiff==vshift){
                    for(int i = 0; i<steps; i++){
                    results[i] = " UR";   
                    }
                    results[0] = "UR";
                }else if(hdiff>vshift){
                    step1 = vshift;
                    for(int i = 0; i<step1; i++){
                        results[i] = " UR";
                    }
                    
                    for(int i = step1; i < steps; i++){
                        results[i] = " R";
                    }
                    results[0] = "UR";                    
                }
                
            }
            
            else  if(j_start>j_end && i_start<i_end){
                if(hdiff<vshift){
                    step1 = (vshift+hdiff)/2 - hdiff;
                    for(int i = 0; i<step1; i++){
                        results[i] = " LR";
                    }
                    
                    for(int i = step1; i < steps; i++){
                        results[i] = " LL";
                    }
                    results[0] = "LR";
                }else if(hdiff==vshift){
                    for(int i = 0; i<steps; i++){
                    results[i] = " LL";   
                    }
                    results[0] = "LL";
                }else if(hdiff>vshift){
                    step1 = vshift;
                    for(int i = 0; i<step1; i++){
                        results[i] = " LL";
                    }
                    
                    for(int i = step1; i < steps; i++){
                        results[i] = " L";
                    }
                    results[0] = "LL";                    
                }
                
            }
            
            else  if(j_start<j_end && i_start<i_end){
                if(hdiff<vshift){
                    step1 = hdiff + (vshift-hdiff)/2;
                    for(int i = 0; i<step1; i++){
                        results[i] = " LR";
                    }
                    
                    for(int i = step1; i < steps; i++){
                        results[i] = " LL";
                    }
                    results[0] = "LR";
                }else if(hdiff==vshift){
                    for(int i = 0; i<steps; i++){
                    results[i] = " LR";   
                    }
                    results[0] = "LR";
                }else if(hdiff>vshift){
                    step1 = steps - vshift;
                    for(int i = 0; i<step1; i++){
                        results[i] = " R";
                    }
                    
                    for(int i = step1; i < steps; i++){
                        results[i] = " LR";
                    }
                    results[0] = "R";                    
                }
                
            }
            
            else if(i_start ==i_end){
                if(j_start>j_end){
                    for(int i = step1; i < steps; i++){
                        results[i] = " L";
                    }  
                    results[0] = "L";
                }else{
                    for(int i = step1; i < steps; i++){
                    results[i] = " R";
                    }
                    results[0] = "R";
                }
                
            }
            
            
            else if(j_start == j_start){
                step1 = vshift/2;

                if(i_start>i_end){
                    for(int i = 0; i<step1; i++){
                        results[i] = " UL";
                    }
                    
                    for(int i = step1; i < steps; i++){
                        results[i] = " UR";
                    }
                    results[0] = "UL";
                }else{
                    for(int i = 0; i<step1; i++){
                        results[i] = " LR";
                    }
                    
                    for(int i = step1; i < steps; i++){
                        results[i] = " LL";
                    }
                    results[0] = "LR";                 
                }
                
            }
            String out = "";
            for (int i = 0; i< steps; i++){
                out = out + results[i];
            }
            System.out.println(out);
        }
        //  Print the distance along with the sequence of moves.
        
    }

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