import java.util.Scanner;

public class ShortestPath
{
    static int xi , xf , yi , yf ;
    static int stepCount = 0 ;
    static String steps[] = new String[200] ;

    static boolean checkPossibility()
    {
        boolean possible = true ;
        if(Math.abs(yf-yi)%2 != 0)
        {
            possible = false ;
        }
        else
        {
            if(Math.abs(yf-yi) == 0 || Math.abs(yf-yi)%4 == 0)
            {
                if(Math.abs(xf-xi)%2 != 0)
                {
                    possible = false ;
                }
            }
            else
            {
                if(Math.abs(xf-xi)%2 == 0)
                {
                    possible = false ;
                }
            }
        }
        return  possible ;
    }


    static void pathprint()
    {
        if((yf-yi == 0) && (xf-xi == 2)) // onestepcloser
        {
            steps[stepCount] = "R" ;
            xi += 2 ;
            stepCount++ ;
        }
        else if((yf-yi == 0) && (xi-xf == 2))    // onestepcloser
        {
            steps[stepCount] = "L" ;
            xi -= 2 ;
            stepCount++ ;
        }

        else if((yi-yf == 2) && (xf-xi == 1))   // onestepcloser
        {
            steps[stepCount] = "UR" ;
            xi += 1 ;
            yi -= 2 ;
            stepCount++ ;
        }

        else if((yi-yf == 2) && (xi-xf == 1))   // onestepcloser
        {
            steps[stepCount] = "UL" ;
            xi -= 1 ;
            yi -= 2 ;
            stepCount++ ;
        }

        else if((yf-yi == 2) && (xi-xf == 1))   // onestepcloser
        {
            steps[stepCount] = "LL" ;
            xi -= 1 ;
            yi += 2 ;
            stepCount++ ;
        }

        else if((yf-yi == 2) && (xf-xi == 1))   // onestepcloser
        {
            steps[stepCount] = "LR" ;
            xi += 1 ;
            yi += 2 ;
            stepCount++ ;
        }
 ///..........................
        else if((xf-xi >= 0) && (yi-yf > 0))
        {
            steps[stepCount] = "UR" ;
            xi += 1 ;
            yi -= 2 ;
            stepCount++ ;
        }
        else  if((xf-xi > 0) && ((yf-yi) >= 0))
        {
            steps[stepCount] = "R" ;
            xi += 2 ;
            stepCount++ ;
        }

        else  if((xf-xi < 0) && ((yf-yi) == 0))
        {
            steps[stepCount] = "L" ;
            xi -= 2 ;
            stepCount++ ;
        }

        else if((xf-xi >= 0) && (yi-yf < 0))
        {
            steps[stepCount] = "LR" ;
            xi += 1 ;
            yi += 2 ;
            stepCount++ ;
        }

        else if((xf-xi <= 0) && (yi-yf <= 0))
        {
            steps[stepCount] = "LL" ;
            xi -= 1 ;
            yi += 2 ;
            stepCount++ ;
        }

        else if((xf-xi <= 0) && (yi-yf >= 0))
        {
            steps[stepCount] = "UL" ;
            xi -= 1 ;
            yi -= 2 ;
            stepCount++ ;
        }
//'''''''''''''''''''

    }

    public static void main(String args[])
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt() ;

        yi = sc.nextInt() ;
        xi = sc.nextInt() ;
        yf = sc.nextInt() ;
        xf = sc.nextInt() ;

        if(!checkPossibility())
        {
            System.out.println("Impossible");
        }
        else
        {
            //coming soon
            while ((xf != xi) || (yf != yi))
            {
                pathprint();
                
            }
            System.out.println(stepCount);
            for(int i = 0 ; i < stepCount ; i++)
            {
                System.out.print(steps[i]+" ");
            }
        }


    }
}