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) {
        //  Print the distance along with the sequence of moves.
      //  System.out.println("Impossible");
        int cnt=0,x=0;
        int[] a;
        a=new int[20];
        while(!((i_start==i_end) && (j_start==j_end)))
        {//upper left
            if((i_end<i_start)&&(j_end<j_start))
            {
              //  System.out.println("UL");
                if((i_start-2)<n)
                i_start=i_start-2;
                 else 
                 {
                     cnt=0;
                     break;
                 }
                j_start=j_start-1;
                 cnt++;
                a[x]=1;
                x++;
            }
         //upper right   
            else if((i_end<i_start)&&((j_end>j_start)))
            {
              //  System.out.println("UR");
                if((i_start-2)<n)
                i_start=i_start-2;
                 else 
                 {
                     cnt=0;
                     break;
                 }
                j_start=j_start+1;
                  cnt++;
                  a[x]=2;
                x++;
            }
             //Right
            else if((i_start==i_end) && (j_end>j_start))
            {
               // System.out.println("R");
                 cnt++;
                 a[x]=3;
                x++;
                break;
            }
            //Lower right   
             else if((i_end>i_start)&&((j_end>j_start)))
            {
              //  System.out.println("LR");
                 if((j_start+2)<n)
                    j_start=j_start+2;
                 else 
                 {
                     cnt=0;
                     break;
                 }
                i_start=i_start+1;
                  cnt++;
                  a[x]=4;
                x++;
            }
            
         //Lower Left   
             else if((i_end>i_start)&&(j_end<j_start))
            {
              //  System.out.println("LL");
                 if((i_start+2)<n)
                i_start=i_start+2;
                  else 
                 {
                     cnt=0;
                     break;
                 }
                j_start=j_start-1;
                  cnt++;
                  a[x]=5;
                x++;
            }
         
            //Left
            else if((i_start==i_end) && (j_end<j_start))
            {
               // System.out.println("L");
                cnt++;
                 a[x]=6;
                x++;
                break;
            }
            
            else if((j_start==j_end)&& (i_start>i_end) )
            {
               // System.out.println("L");
                if((i_start-2)<n)
                 i_start=i_start-2;
                 else 
                 {
                     cnt=0;
                     break;
                 }
                j_start=j_start-1;
                cnt++;
                 a[x]=1;
                x++;
              
            }
             else if((i_end>i_start)&&((j_end==j_start)))
            {
              //  System.out.println("LR");
                 if((i_start+2)<n)
                i_start=i_start+2;
                  else 
                 {
                     cnt=0;
                     break;
                 }
                j_start=j_start+1;
                  cnt++;
                  a[x]=4;
                x++;
            }
            
            else    
            {
               
                cnt=0;
                 break;
            }
           
        }if(cnt==0)
        {
             System.out.println("Impossible");
        }
        else
        {
        System.out.println(cnt);
        for(int i=0;i<cnt;i++)
        {
            if(a[i]==1)
             System.out.print("UL ");
            
            if(a[i]==2)
             System.out.print("UR ");
            
            if(a[i]==3)
             System.out.print("R ");
            
            if(a[i]==4)
             System.out.print("LR ");
            
            if(a[i]==5)
             System.out.print("LL ");
            
            if(a[i]==6)
             System.out.print("L ");
        }
    }
   }

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