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) {
		int x,y,sum;
		
        //Impossible Control
        if (((i_start - j_start) % 2) != 0) {
			System.out.print("Impossible");
		}

		else if ((i_start > j_start) && (i_end > j_end)) {
			x = (i_start - j_start) / 2;
            y=((i_end-j_end)-x)/2; 
            sum=x+y;   
            System.out.println(x+y);
            while(x>0) {
            	System.out.print("UL"+" ");
               --x;
            }
            while(y>0) {
            	System.out.print("L");
               --y;
            }
		
		
		}
		 else if ((i_start > j_start) && (i_end < j_end)) {
			x = (j_start - i_start) / 2;
            y=((i_end-j_end)-x)/2; 
            System.out.println(x+y);
            while(x>0) {
            	System.out.print("UR"+" ");
               --x;
            }
            while(y>0) {
            	System.out.print("R"+" ");
               --y;
            }
		}
        else if ((i_start < j_start) && (i_end > j_end)) {
			x = (j_start - i_start) / 2;
            y=((i_end-j_end)-x)/2; 
            System.out.println(x+y);
            while(x>0) {
            	System.out.print("LL"+" ");
               --x;
            }
            while(y>0) {
            	System.out.print("L"+" ");
               --y;
            }
		}
            else if ((i_start < j_start) && (i_end < j_end)) {
    			x = (j_start - i_start) / 2;
                y=((j_start-j_end)-x)/2; 
                while(x>0) {
                	System.out.print("LR"+" ");
                   --x;
                }
                while(y>0) {
                	System.out.print("R"+" ");
                   --y;
                }
            
            }
           else if((i_start < j_start)&&(i_end==j_end)) {
              
               if((j_start-i_start)%4==0){
               x=(j_start-i_start)/2;
              System.out.println(x);
               while(x>0) {
                	System.out.print("LR"+" ");
                   --x;
                if(x>0)
                   System.out.print("LL"+" ");
                   --x;
               }
               }
               else
                    System.out.print("Impossible");
                   
               
               
           }
           else if((i_start > j_start)&&(i_end==j_end)) {
              if((i_start-j_start)%4==0){
               x=(i_start-j_start)/2;
              System.out.println(x);
               while(x>0) {
                	System.out.print("UL"+" ");
                   --x;
                if(x>0)
                   System.out.print("UR"+" ");
                   --x;
               }
               
               
               
               
           }  
        else
            System.out.print("Impossible");
            
		
		}
    }
		

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