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) {
        
        String[] a=new String[n]; int i=0,k=0,l;
            l=1;
            switch(l)
            {
                case 1: 
                    {
                       while(i_start!=i_end && j_start!=j_end)
                       {
                      if(i_start>=0 && j_start<=n-1)
                            {
            if(i_start>=2 && i_start<=n-1 && j_start>=1 && j_start<=n-1 )
                              {
                              i_start-=2; j_start--;
                              a[i]="UL"; i++;
                              }else break;
                            } 
                           else{
                            break;
                        }
                        }  
                    }
                case 2: 
                    {
                       while(i_start!=i_end && j_start!=j_end)
                       {
                      if(i_start>=0 && j_start<=n-1)
                            {
                 if(i_start>=2 && i_start<=n-1 && j_start<=n-2 && j_start>=0)
                              {
                              i_start-=2; j_start++;
                              a[i]="UR"; i++;
                              }else break;
                            }
                           else{
                            break;
                        }
                        }
                    }
              case 3: 
                    {
                       while(j_start!=j_end)
                       {
                      if(i_start>=0 && j_start<=n-1)
                            {
                  if(j_end>j_start && j_start<=n-3)
                              {
                              j_start+=2;
                              a[i]="R"; i++;
                          }else break;
                            }
                           else{
                            break;
                        }
                        }
                    }
                case 4: 
                    {
                       while(i_start!=i_end && j_start!=j_end)
                       {
                      if(i_start>=0 && j_start<=n-1)
                            {
                if(i_start<=n-3 && j_start<=n-2 && j_start>=0)
                              {
                              i_start+=2; j_start++;
                              a[i]="LR"; i++;
                              }
                            } 
                           else{
                            break;
                        }
                        }
                    }
             
               case 5: 
                    {
                       while(i_start!=i_end && j_start!=j_end)
                       {
                      if(i_start>=0 && j_start<=n-1)
                            {
                  if(i_start<=n-3 && j_start>=1)
                              {
                              i_start+=2; j_start--;
                              a[i]="LL"; i++;
                              }else break;
                            }
                           else{
                            break;
                        }
                        }
                    }
               case 6: 
                    {
                    while(j_start!=j_end)
                       {
                      if(i_start>=0 && j_start<=n-1)
                            {
                          if(j_end<j_start && j_start>=2)
                              {
                              j_start-=2;
                              a[i]="L"; i++;
                      }else break;
                            }
                           else{
                            break;
                        }
                        }
                    }
            }
        
        if(i_start==i_end && j_start==j_end)
        {
         System.out.println(i);
        for(int j=0;j<i;j++)
        {
            System.out.print(a[j]+" ");
        }
        }
        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();
    }
}