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 i1, int j1, int i2, int j2) {
       
        String s="";
        int count=0,found=0;
        while(found==0 && s!="Impossible")
        {
            
            if(i1>j1 && i1-2>=0){
                if(i1-2==i2){
                    if(i2-1==j2){s+="UL"+" ";count++;found=1;break;}
                    else if(i2+1==j2){s+="UR"+" ";found=1;count++;break;}
                    else{}       
                            }
                 if(found==0){i1=i1-2;
                              if(i2-2>=0){i2=i2-1;s+="UL"+" "; count++;}
                              else if(i2+1<n){ i2=i2+1;s+="UR"+" "; count++;}
                 else{count=0;s="Impossible";found=1;break;}    }
                          
            }
            
            else if(i1<j1 && i1+2<n)
            {

            if(i1+2==j1){if(i2+1==j2){s+="LR"+" ";count++;found=1;}
                         else if(i2-1==j2){s+="LL"+" ";found=1;count++;}}
            if(found==0){i1=i1+2;
                         if(i2+1>=0){i2=i2+1;count++;s+="LR"+" ";}
                         else if(i2-1<n){i2=i2-1;count++;s+="LL"+" ";}
                         else{count=0;s="Impossible";found=1;break;}}
            
            }
            else if(i1==j1)
            {
                if(i2==j2){found=1;break;}
                else if(i2<j2 && i2+2<n){i2=i2+2;count++;s+="R";
                                         if(i2==j2){break;}}
                else if(i2>j2 && i2-2>=0){i2=i2-2;count++;s+="L"+" ";if(i2==j2){found=1;break;}}
                else{count=0;s="Impossible";found=1;break;}
                
                
            
            }
            else{
                
                count=0;s="Impossible";found=1;break;
                
            }
            
            
           if(count==0){found=1;} 
            
            
            
        }
        if(count>0)System.out.println(count);
        System.out.println(s);
        
        
    
    }

    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,i_end, j_start,  j_end);
        in.close();
    }
}