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 i,j,k,l,count=0, g;
        ArrayList l1 = new ArrayList();
        if( i_start < i_end && j_start < j_end)
        {
            while(i_start < i_end)
            {
                i_start = i_start + 2;
                j_start = j_start + 1;
                count = count+1;
                l1.add("LR");
            }
            if(i_start == i_end && j_start == j_end)
            {
                System.out.println(count);
                
                     System.out.println(l1);
                
               
            }
            else if( i_start != i_end || j_end == j_start+1 || j_end == j_start-1)
            {
                System.out.println("Impossible");
            }
            else 
            {
                count = count + 1 ;
                l1.add("R");
                System.out.println(count);
                
                     System.out.println(l1);
                
            }
        }
        else if ( i_start > i_end && j_start > j_end)
        {
            while(i_start > i_end)
            {
                i_start = i_start - 2;
                j_start = j_start -1;
                count = count + 1 ;
                l1.add("UL");
            }
            if(i_start == i_end && j_start == j_end)
            {
                System.out.println(count);
               
                     System.out.println(l1);
                
               
            }
            else if( i_start != i_end || j_end == j_start-1 || j_end == j_start+1)
            {
                System.out.println("Impossible");
            }
             else 
            {
                count = count + 1 ;
                l1.add("L");
                System.out.println(count);
               
                     System.out.println(l1);
                
            }
            
        }
        else if(i_start < i_end && j_start > j_end)
        {
            while(i_start < i_end)
            {
                i_start = i_start + 2;
                j_start = j_start - 1;
                count = count+1;
                l1.add("LL");
            }
            if(i_start == i_end && j_start == j_end)
            {
                System.out.println(count);
               
                     System.out.println(l1);
                
               
            }
            else if( i_start != i_end || j_end == j_start-1 || j_end == j_start+1)
            {
                System.out.println("Impossible");
            }
             else 
            {
                count = count + 1 ;
                l1.add("L");
                System.out.println(count);
               
                     System.out.println(l1);
                
            }
        }
        else if ( i_start > i_end && j_start < j_end )
        {
            while(i_start > i_end)
            {
                i_start = i_start - 2;
                j_start = j_start + 1;
                count = count + 1 ;
                l1.add("UR");
            }
             if(i_start == i_end && j_start == j_end)
            {
                System.out.println(count);
               
                
                     System.out.println(l1);
                
               
            }
             else if( i_start != i_end || j_end == j_start-1 || j_end == j_start+1)
            {
                System.out.println("Impossible");
            }
             else 
            {
                count = count + 1 ;
                l1.add("R");
                System.out.println(count);
                
                     System.out.println(l1);
                
            }
        }
        else if(i_start == i_end && j_start != j_end)
        {
            if(j_start < j_end)
            {
                 int ans = j_end % 2;
                 if(ans != 0)
                 {
                     System.out.println("Impossible");
                    
                 }
                 else
                 {
                     do
                     {
                         j_start ++;
                         count ++ ;
                         l1.add("R");
                     }while(j_start < j_end);
                     System.out.println(count);
                 
                     System.out.println(l1);
                
                 }
             }
            else if (j_start > j_end)
            {
                int ans = j_end % 2;
                 if(ans != 0)
                 {
                     System.out.println("Impossible");
                    
                 }
                 else
                 {
                      do
                     {
                         j_start --;
                          count ++ ;
                          l1.add("L");
                     }while(j_start > j_end);
                       System.out.println(count);
                  
                     System.out.println(l1);
                
                 }
            }
                 
        }
        else if(i_start != i_end && j_start == j_end )
         {
            if( i_start < i_end)
            {
                 int ans = i_end % 2;
                 if(ans != 0)
                 {
                     System.out.println("Impossible");
                    
                 }
                 else if(i_start < i_end)
                 {
                     int flag = 0 ;
                     do
                     {
                         i_start = i_start + 3;
                         if(flag == 0)
                         {
                             l1.add("LR");
                             flag = 1;
                             count ++ ;
                         }
                         else
                         {
                             l1.add("LL");
                             flag = 0 ;
                             count ++ ;
                         }
                     }while(i_start < i_end);
                     System.out.println(count);
                
                     System.out.println(l1);
                
                 }
                 else if(i_start > i_end)
                 {
                      int flag = 0 ;
                     do
                     {
                         i_start = i_start - 3;
                         if(flag == 0)
                         {
                             l1.add("UL");
                             flag = 1;
                             count ++ ;
                         }
                         else
                         {
                             l1.add("UR");
                             flag = 0 ;
                             count ++ ;
                         }
                 }while(i_start > i_end);
                   System.out.println(count);
                 
                     System.out.println(l1);
                  
            }
         }
    }
    }   

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