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 rd=i_start-i_end;
        int cd=j_start-j_end;
        int count=0;
      
        HashMap hm=new HashMap();
        hm.put("UL ",0);
        hm.put("UR ",1);
        hm.put("R ",2);
        hm.put("LR ",3);
        hm.put("LL ",4);
        hm.put("L ",5);
        ArrayList al=new ArrayList();
        
        if(rd%2!=0)
        {    System.out.println("Impossible");
        System.exit(1);}
        
        if(rd==0 && cd%2!=0)
        { System.out.println("Impossible");
        System.exit(1);}      
         
    
        if(cd==0 && (rd/2)%2!=0)
        {
            System.out.println("Impossible");
        System.exit(1);       
        }
        
        
        while(i_start!=i_end||j_start!=j_end)
        {
            
            if(rd%2!=0)
        {    System.out.println("Impossible");
        System.exit(1);}
        
        if(rd==0 && cd%2!=0)
        { System.out.println("Impossible");
        System.exit(1);}      
         
    
        if(cd==0 && (rd/2)%2!=0)
        {
            System.out.println("Impossible");
        System.exit(1);       
        }
        
            
            if(rd>0 &&cd>0)
            {
                i_start-=2;j_start-=1;
              al.add("UL ");
                count++;
            }
            else if(rd>0 &&cd<0)
            {
                i_start-=2;j_start+=1;
             al.add("UR ");
                count++;
           }
           else if(rd<0 &&cd>0)
            {
               i_start+=2;j_start-=1;
              al.add("LL ");
               count++;
            }
            else if(rd<0 &&cd<0)
            {
                i_start+=2;j_start+=1;
              al.add("LR ");
                count++;
           }
            else if(rd==0 &&cd>0)
            {
                 if(rd>1&&rd<n-1)
                {   i_start-=2;j_start-=1;
              al.add("UL ");
               }
                
                else{
                j_start-=2;
                al.add("L ");}
                count++;     
             }
            else if(rd==0 &&cd<0)
            {
                 if(rd>1&&rd<n-1)
                {
                     i_start-=2;j_start+=1;
             al.add("UR ");        
                }
               else{
                j_start+=2;
                   al.add("R ");}
                count++;
             }
            else if(rd>0 &&cd==0)
            {
                 i_start-=2;j_start-=1;
                al.add("UL ");
                count++;
            }
            else if(rd<0 &&cd==0)
            {
                int eigthflag=0;
                 i_start+=2;j_start+=1;
                if(i_start<n &&i_start>=0 && j_start<n&&j_start>=0)
                {  al.add("LR "); eigthflag=1;}
                else
                { i_start-=2;j_start-=1;}
                
                if(eigthflag==0)
                {
                    i_start+=2;j_start-=1;
                    if(i_start<n &&i_start>=0 && j_start<n&&j_start>=0)
                    { al.add("LL ");}
                }
                count++;
            }
            rd=i_start-i_end;
           cd=j_start-j_end;   
            
            if(count>1)
            {
                    String str1=(String)al.get(count-1);
                        String str2=(String)al.get(count-2);
                
                if((Integer)hm.get(str1)<(Integer)hm.get(str2))
                {
                    al.set(count-1,str2);
                    al.set(count-2,str1);
                }
           }
                 
        }//while end
        System.out.println(count);
        
        Iterator itr=al.iterator();
        while(itr.hasNext())
        {
            System.out.print(itr.next());
        }
    }

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