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) {
       
        if((i_start>i_end||i_start<i_end)&&Math.abs(i_start-i_end)%2!=0)
        {
            System.out.println("Impossible");
        }
        else if(i_start==i_end&&Math.abs(j_start-j_end)%2!=0)
        {
            System.out.println("Impossible");
        }
        else
        {
            if((j_start-j_end)<0)
            {
                String str="";
                int ifi=i_end;
                int jf=j_end;
                int ii=i_start;
                int ji=j_start;
                if((i_start-i_end)<0)
                {
                    int count=0;
                    while(ii!=ifi)
                    {
                        ii=ii+2;
                        ji=ji+1;
                        str=str+"LR ";
                        count++;
                    }
                    while(ji!=jf)
                    {
                        ji=ji+2;
                        str=str+"R ";
                        
                        count++;
                    }
                    System.out.println(count);
                    System.out.println(str);
                }
               else if((i_start-i_end)>0)
                {
                    int count=0;
                    while(ii!=ifi)
                    {
                        ii=ii-2;
                        ji=ji+1;
                        str=str+"UR ";
                        count++;
                    }
                    while(ji!=jf)
                    {
                        ji=ji+2;
                        str=str+"R ";
                        count++;
                    }
                    System.out.println(count);
                   System.out.println(str);
                }
                else
                {
                     int count=0;
                    while(ji!=jf)
                    {
                        ji=ji+2;
                        str=str+"R ";
                        count++;
                    }
                    System.out.println(count);
                    System.out.println(str);
                }
                
                
            }
            
            else if((j_start-j_end)>0)
            {
                
                String str="";
                int ifi=i_end;
                int jf=j_end;
                int ii=i_start;
                int ji=j_start;
                if((i_start-i_end)<0)
                {
                    int count=0;
                    while(ii!=ifi)
                    {
                        ii=ii+2;
                        ji=ji-1;
                        str=str+"LL ";
                        count++;
                    }
                    while(ji!=jf)
                    {
                        ji=ji+2;
                        str=str+"L ";
                        
                        count++;
                    }
                    System.out.println(count);
                    System.out.println(str);
                }
               else if((i_start-i_end)>0)
                {
                    int count=0;
                    while(ii!=ifi)
                    {
                        ii=ii-2;
                        ji=ji-1;
                        str=str+"UL ";
                        count++;
                    }
                    while(ji!=jf)
                    {
                        ji=ji-2;
                        str=str+"L ";
                        count++;
                    }
                    System.out.println(count);
                   System.out.println(str);
                }
                else
                {
                     int count=0;
                    while(ji!=jf)
                    {
                        ji=ji-2;
                        str=str+"L ";
                        count++;
                    }
                    System.out.println(count);
                    System.out.println(str);
                }
                
 
                
            }
            
            
            else if((j_start-j_end)==0)
            {
                
                String str="";
                int ifi=i_end;
                int jf=j_end;
                int ii=i_start;
                int ji=j_start;
                
                if((i_start-i_end)>0)
                {
                    int count=0;
                  int k=  Math.abs(ii-ifi)/2;
                while(k>0)
                    {
                        ji=ji-2;
                        str=str+"UL UR";
                        count++;
                    k--;
                    }
                 System.out.println(count);
                    System.out.println(str);
                }
                else
                {
                    int count=0;
                    int k=  Math.abs(ii-ifi)/2;
                     while(k/2>0)
                    {
                        ji=ji-2;
                        str=str+"LR LL ";
                        count++;
                         k--;
                    }
                 System.out.println(count*2);
                    System.out.println(str);
                    
                }
                
                    
            }
            
        }
            
            
        
    }

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