import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution

{ static String[] printShortestPath(int n, int istart, int jstart, int iend, int jend) {        
    int diff=istart-iend;int count=0;
    if(diff<0)
    {diff=0-diff;} int j=0;
    String ss[]=new String[diff];
    for(int i=0;i<diff;i++)
    {ss[i]=" ";}
    while((istart!=iend)||(iend!=jend))
	{if(istart<iend){
       count++; istart=istart+(2);
                if(jstart<jend)
                {jstart=jstart+(1);
                  ss[j]="LR";}
                 else if(jstart>jend)
                 {jstart=jstart-(1);
                 ss[j]="LL";}
                 else if(jstart==jend)
                	 ss[j]="Impossible";
                 
                 }
       
        else if(istart>iend){       
          count++;    istart=istart-(2);
                  if(jstart<jend)
                {jstart=jstart+(1); 
                ss[j]="UR";}
                   else if(jstart>jend)
                 {jstart=jstart-(1);
                 ss[j]="UL";}
                   else if(jstart==jend)
                   { ss[j]="Impossible";
                 }
        }
        else if(istart==iend)
        {count++;
        if(jstart<jend)
        {jstart=jstart+2; ss[j]="R";}
         else if(jstart>jend)
         {jstart=jstart-2; ss[j]="L";}
          }j++; }
   //s[j]=Integer.toString(count);
	return ss;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int istart = in.nextInt();
        int jstart = in.nextInt();
        int iend = in.nextInt();
        int jend = in.nextInt();
        int diff=istart-iend;    
        String aa[]=printShortestPath(n, istart, jstart, iend, jend);
        int count=aa.length;
         System.out.println(count);
        for(int i=0;i<aa.length;i++)
        {
        System.out.print(aa[i]);}
    
    }
}