import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
  static String seq="Impossible";
    static int run=99999;
        static int x1,x2,y1,y2;
   
    static void min(int x,int y,StringBuffer b1,int count,int n)
    {
        
        if((x>-1&x<n)&(y>-1&y<n))
        {
            if(x==x1&y==y1)
            {
             if(run>count)
             {
                 run=count;
                 seq=b1.toString();
             }
                
                
            }
            StringBuffer b=new StringBuffer(b1);
            if(y==y1)
            {
                if(x>x1)
                {
                    if((x-2)>=x1)
                    { min(x-2,y-1,b.append("UL "),count+1,n);
                      min(x-2,y+1,b.append("UR "),count+1,n);
                    }  
                }else
            {
                if((x+2)<=x1)   
                     {
                     min(x+2,y+1,b.append("LR "),count+1,n);
                     min(x+2,y-1,b.append("LL "),count+1,n);
                     }
            }
            }
               else if(x==x1)
              {
             if(y>y1)
             {
                 if((y-2)>=y1) 
                     { min(x,y-2,b.append("L "),count+1,n);}
             }else
             {
                  if((y+2)<=y1)    
                     {
                      min(x,y+2,b.append("R "),count+1,n);}
             }
            
           }
           else if(y>y1&x>x1)
            {    
                if((x-2)>=x1)
                    { min(x-2,y-1,b.append("UL "),count+1,n);} 
                
            }
              else if(y<y1&x>x1)
                {
                    if((x-2)>=x1)     
                     {   
                 min(x-2,y+1,b.append("UR "),count+1,n);}
                            
                }
               else if(y>y1&x<x1)
               {
                    if((x+2)<=x1)   
                     { min(x+2,y-1,b.append("LL "),count+1,n);}
               }
               else if(y<y1&x<x1)
               {
                     if((x+2)<=x1)     
                     {   
               min(x+2,y+1,b.append("LR "),count+1,n);
                     }
               }
        
               }}
               
    static void printShortestPath(int n, int i1, int j1, int i2, int j2) {
        //  Print the distance along with the sequence of moves. 
        x2=i1;
        x1=i2;
        y2=j1;
        y1=j2;
        int xdist,ydist;
    //  int count=0;
    //    xdist=Math.abs(i2-i1);
   //     ydist=Math.abs(j2-j1);
        StringBuffer s=new StringBuffer("");
           
        min(x2,y2,s,0,n);
            if(run<99999)
            {System.out.println(run);}
        
        System.out.println(seq);
    
    }

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