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.
        String result = "";
        int flag=0;
        while(i_start<i_end){
        if(j_end<j_start){      //...
        //System.out.print("LL ");
        result = result+"LL ";
        i_start = i_start+2;
        j_start--;
        
        }
        else if(j_end>j_start){
        //System.out.print("LR ");
        result = result+"LR ";
        i_start = i_start+2;
        j_start++;
        //System.out.println(i_start+","+j_start+"LR2 ");
        }
        else{
        if(((i_end-i_start)%2)!=0){
        flag=1;
        break;
        }
            else{
                if(j_start==(n-1)){
                    result = result+"LL ";
        i_start = i_start+2;
        j_start--;
        
                }
                if(j_start==0){
                    result = result+"LR ";
        i_start = i_start+2;
        j_start++;
        
                }
                 //if((i_start!=j_start)&&(i_end!=j_end)){
                 else{  
                 result = result+"LR ";
        i_start = i_start+2;
        j_start++;
        
                }
                
            }
            //System.exit(1);
        
        }
        
        }
        while(i_start>i_end){
        if(j_end>j_start){
          //  System.out.print("UR ");
        result = result+"UR ";
            i_start = i_start-2;
        j_start++;
        
        }
        else if(j_end<j_start){
        //System.out.print("UL ");
        result = result+"UL ";
        i_start = i_start-2;
        j_start--;
        
        }
        else{
                
        if(((i_end-i_start)%2)!=0){
        flag=1;
        break;}
            if(j_start==0){
                result = result+"UR ";
            i_start = i_start-2;
        j_start++;
        
            }
            if(j_start==(n-1)){
                result = result+"UL ";
        i_start = i_start-2;
        j_start--;
        
            }
            // if((i_start!=j_start)&&(i_end!=j_end)){
            else{  
            result = result+"UL ";
        i_start = i_start-2;
        j_start--;
       // System.out.println(i_start+","+j_start+"UL10 ");
            }
            
        }
        }
        int yDifference = j_end - j_start;
        if((yDifference%2)!=0){
                flag=1;
            //System.exit(1);
        }
        
        while(j_end<j_start){
        //System.out.print("R ");
        result = result+"L ";
        j_start=j_start-2;
        }
        while(j_end>j_start){
        //System.out.print("L ");
        result = result+"R ";
        j_start = j_start+2;
        }
        if(flag==1){
            System.out.print("Impossible");
        }
        else{
        String[] s = result.split("\\s+");
        System.out.println(s.length);
        System.out.print(result);}}

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