import java.util.Arrays;
import java.util.Scanner;

 class Red_knights_shortest_path {
	static int getPriority(String str)
	{
		switch(str)
		{
		case "UL":return 1;
		case "UR":return 2;
		case "R":return 3;
		case "LR":return 4;
		case "LL":return 5;
		case "L":return 6;
		
		}
		return -1;
	}
	static void print(int a)
	{
		switch(a)
		{
		case 1:System.out.print("UL");break;
		case 2:System.out.print("UR");break;
		case 3:System.out.print("R");break;

		case 4:System.out.print("LR");break;

		case 5:System.out.print("LL");break;

		case 6:System.out.print("L");break;

		
		}
		
	}
	static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
       int a,b,x = 0,y = 0;
       int c=0,min =Integer.MAX_VALUE,val = 0;
       int f=0;
       String str="";
       String path[]=new String[n];
       
       while(c<n &&(i_start!=i_end||j_start!=j_end))
       {
    	   
    	f=0;
    	
    	   a=i_start-2;
    	   b=j_start-1;
    	   if(a>=0&&a<n)
    	   {
    		   if(b>=0&&b<n)
    		   {
    			   min=Math.abs(i_end-a)+Math.abs(j_end-b);
    			   str="UL";
    			   x=a;y=b;
    			   f=1;
    		   }
    		   b=j_start+1;
    		   if(b<n)
    		   {
    			   val=Math.abs(i_end-a)+Math.abs(j_end-b);
    			   if(val<min)
    			   {
    				   min=val;
    				   str="UR";
    				   x=a;y=b;
    				   f=1;
    			   }
    		   }
    	   }
    	   a=i_start;b=j_start+2;
    	   if(b<n)
    	   {
    		   val=Math.abs(i_end-a)+Math.abs(j_end-b);
			   if(val<min)
			   {
				   min=val;
				   str="R";
				   x=a;y=b;
				   f=1;
			   }
    	   }
    	   a=i_start+2;
    	   b=j_start+1;
    	   if(a<n)
    	   {
    		   if(b<n)
    		   {
    			   val=Math.abs(i_end-a)+Math.abs(j_end-b);
    			   if(val<min)
    			   {
    				   min=val;
    				   str="LR";
    				   x=a;y=b;
    				   f=1;
    			   }
    		   }
    		   b=j_start-1;
    		   if(b>=0&&b<n)
    		   {
    			   val=Math.abs(i_end-a)+Math.abs(j_end-b);
    			   if(val<min)
    			   {
    				   min=val;
    				   str="LL";
    				   x=a;y=b;
    				   f=1;
    			   }
    		   }
    	   }
    	   a=i_start;
    	   b=j_start-2;
    	   if(b>=0&&b<n)
    	   {
    		   val=Math.abs(i_end-a)+Math.abs(j_end-b);
    		   if(val<min)
			   {
				   min=val;
				   str="L";
				   x=a;y=b;
				   f=1;
			   }
    	   }
    	   if(f==0)
    	   {
    		  // System.out.println("kkk");
    		   break;
    		   
    	   }
    		   
    	   path[c]=str;
    	   
    	 // System.out.println(path[c]+" ");
    	   c++;
    	   i_start=x;
    	   j_start=y;
    	 //  System.out.println(i_start+" "+j_start);
    	  
    	   
    	   
       }
       if(i_start==i_end && j_start==j_end)
       {	   
	     System.out.println(c);
	     int ar[]=new int[n];
	       for(int i=0;i<c;i++)
	       {
	    	  ar[i]=getPriority(path[i]);

	    	  // System.out.print(ar[i]+" ");
	       }
	       Arrays.sort(ar,0,c);
	       
	       for(int i=0;i<c;i++)
	       {
	    	   //System.out.print(ar[i]+" ");
	    	   print(ar[i]);
	    	   System.out.print(" ");
	       }
       }
       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();
	    }

}