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<n&&i_end<n&&j_start<n&&j_end<n){
        if(i_start==i_end){
            int k=j_start-j_end;
            if(k<0) k=-k;
            if(k%2==0){
                System.out.println(k/2);
                if(j_start>j_end){
                while(k>0){
                    System.out.print("L"+" ");
                    k=k-2;
                }
                }
                else if(j_start<j_end){
                     while(k>0){
                    System.out.print("R"+" ");
                    k=k-2;
                }
                }
                else 
                    System.out.println("Impossible");
            }           
        }//end of istart==iend
        
       else if(j_start==j_end){
            int k=i_start-i_end;
            if(k<0) k=-k;
            if(k%4==0){
                System.out.println(k/2);
                if(i_start>i_end){
                while(k>0){
                    System.out.print("UL"+" ");
                    System.out.print("UR"+" ");
                    k=k-4;
                }
                }
                else if(i_start<i_end){
                     while(k>0){
                    System.out.print("LR"+" ");
                         System.out.print("LL"+" ");
                    k=k-4;
                }
                }
            }
           else 
               System.out.println("Impossible");
        }//end of jstart==jend
        
        else if(i_start!=i_end&&j_start!=j_end)
        {
            if(i_start>i_end){
                int id,jd;
                if(j_start>j_end){
                     id=i_start-i_end;
                     jd=j_start-j_end;
                    if(jd%2!=0){
                        int k=i_start-id;
                        int p=j_start-id/2;
                        if(p==j_end){
                            int t=id;
                            System.out.println(id/2);
                            while(t>0){
                                System.out.print("UL"+" ");
                                t=t-2;
                            }
                        }
                        else if(p!=j_end){
                            if(p>j_end){
                                int x=p-j_end;
                                 if(x%2!=0){
                                    System.out.println("Impossile");
                                 }
                                else {
                                    System.out.println(id/2+x/2);
                                    int t=id;
                                while(t>0){
                                    System.out.print("UL"+" ");
                                    t=t-2;
                                }
                                while(x>0){
                                    
                                    System.out.print("L"+" ");
                                    x=x-2;
                                }
                                }
                            }
                            else if(p<j_end){
                                int x=j_end-p;
                                 if(x%2!=0){
                                    System.out.println("Impossile");
                                 }
                                else {
                                    System.out.println(id/2+x/2);
                                    int t=id;
                                while(t>0){
                                    System.out.print("UL"+" ");
                                    t=t-2;
                                }
                                while(x>0){
                                    
                                    System.out.print("R"+" ");
                                    x=x-2;
                                }
                                }
                            }
                        }
                        
                    }
                    else
                        System.out.println("Impossible");
                    
                }//end of jstart greater than  jend
                
                else if(j_start<j_end){
                     id=i_start-i_end;
                     jd=j_end-j_start;
                    if(jd%2!=0){
                        int k=i_start-id;
                        int p=j_start+id/2;
                        if(p==j_end){
                            System.out.println(id/2);
                            int t=id;
                            while(t>0){
                                System.out.print("UR"+" ");
                                t=t-2;
                            }
                        }
                        else if(p!=j_end){
                            if(p<j_end){
                                int x=j_end-p;
                                 if(x%2!=0){
                                    System.out.println("Impossile");
                                 }
                                else {
                                    System.out.println(id/2+x/2);
                                    int t=id;
                                while(t>0){
                                    System.out.print("UR"+" ");
                                    t=t-2;
                                }
                                while(x>0){
                                    
                                    System.out.print("R"+" ");
                                    x=x-2;
                                }
                                }
                            }
                            else if(p>j_end){
                                int x=p-j_end;
                                 if(x%2!=0){
                                    System.out.println("Impossile");
                                 }
                                else {
                                    System.out.println(id/2+x/2);
                                    int t=id;
                                while(t>0){
                                    System.out.print("UR"+" ");
                                    t=t-2;
                                }
                                while(x>0){
                                    
                                    System.out.print("L"+" ");
                                    x=x-2;
                                }
                                }
                            }
                        }
                        
                    }
                    else
                        System.out.println("Impossible");
                }//end of jstart<jend
            }//end of istart>iend
            
            else if(i_start<i_end){
                                int id,jd;
                if(j_start>j_end){
                     id=i_start-i_end;
                     jd=j_start-j_end;
                    if(jd%2!=0){
                        int k=i_start-id;
                        int p=j_start-id/2;
                        if(p==j_end){
                            int t=id;
                            while(t>0){
                                System.out.print("LL"+" ");
                                t=t-2;
                            }
                        }
                        else if(p!=j_end){
                            if(p>j_end){
                                int x=p-j_end;
                                 if(x%2!=0){
                                    System.out.println("Impossile");
                                 }
                                else {
                                    int t=id;
                                while(t>0){
                                    System.out.print("LL"+" ");
                                    t=t-2;
                                }
                                while(x>0){
                                    
                                    System.out.print("L"+" ");
                                    x=x-2;
                                }
                                }
                            }
                            else if(p<j_end){
                                int x=j_end-p;
                                 if(x%2!=0){
                                    System.out.println("Impossile");
                                 }
                                else {
                                    int t=id;
                                while(t>0){
                                    System.out.print("LL"+" ");
                                    t=t-2;
                                }
                                while(x>0){
                                    
                                    System.out.print("R"+" ");
                                    x=x-2;
                                }
                                }
                            }
                        }
                        
                    }
                    else
                        System.out.println("Impossible");
                    
                }//end of jstart greater than  jend
                
                else if(j_start<j_end){
                     id=i_start-i_end;
                     jd=j_end-j_start;
                    if(jd%2!=0){
                        int k=i_start-id;
                        int p=j_start+id/2;
                        if(p==j_end){
                            int t=id;
                            while(t>0){
                                System.out.print("LR"+" ");
                                t=t-2;
                            }
                        }
                        else if(p!=j_end){
                            if(p<j_end){
                                int x=j_end-p;
                                 if(x%2!=0){
                                    System.out.println("Impossile");
                                 }
                                else {
                                    int t=id;
                                while(t>0){
                                    System.out.print("LR"+" ");
                                    t=t-2;
                                }
                                while(x>0){
                                    
                                    System.out.print("R"+" ");
                                    x=x-2;
                                }
                                }
                            }
                            else if(p>j_end){
                                int x=p-j_end;
                                 if(x%2!=0){
                                    System.out.println("Impossile");
                                 }
                                else {
                                    int t=id;
                                while(t>0){
                                    System.out.print("LR"+" ");
                                    t=t-2;
                                }
                                while(x>0){
                                    
                                    System.out.print("L"+" ");
                                    x=x-2;
                                }
                                }
                            }
                        }
                        
                    }
                    else
                        System.out.println("Impossible");
                }//end of jstart<jend
            }
        }//end of rest
        }
        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();
    }
}