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 is, int js, int ie, int je) {
        if((is<n)&&(js<n)&&(ie<n)&&(je<n)&&(is>=0)&&(js>=0)&&(ie>=0)&&(je>=0))
        {
            int c=0;
            if(((Math.abs(is-ie))%2)==0)
            {
                int a=(Math.abs(is-ie))/2;
                int b=Math.abs(js-je);
                if(((a%2==0)&&(b%2==0))||((a%2!=0)&&(b%2!=0)))
                {
                    if((ie<is)&&(je>js))
                    {
                       
                        is=is-(a*2);
                        js=js+(a*1);
                        while(js!=je)
                        {
                            js=js+2;
                            c++;
                        }
                        System.out.println((c+a));
                        for(int i=1;i<=(a+c);i++)
                        {
                            if(i<=a)
                                System.out.print("UR ");
                            else
                                System.out.print("R ");
                        }
                    }
                    else if((ie<is)&&(je<js))
                    {
                            is=is-(a*2);
                            js=js-(a*1);
                        while(js!=je)
                        {
                            js=js-2;
                            c++;
                        }
                        System.out.println((c+a));
                        for(int i=1;i<=(a+c);i++)
                        {
                            if(i<=a)
                                System.out.print("UL ");
                            else
                                System.out.print("L ");
                        }
                    }
                    else if((ie>is)&&(je<js))
                    {
                            is=is+(a*2);
                            js=js-(a*1);
                        while(js!=je)
                        {
                            js=js-2;
                            c++;
                        }
                        System.out.println((a+c));
                        for(int i=1;i<=(a+c);i++)
                        {
                            if(i<=a)
                                System.out.print("LL ");
                            else
                                System.out.print("L ");
                        }
                    }
                    else if((ie>is)&&(je>js))
                    {
                        is=is+(a*2);
                        js=js+(a*1);
                        while(js!=je)
                        {
                            js=js+2;
                            c++;
                        }
                        System.out.println((c+a));
                        for(int i=1;i<=(c+a);i++)
                        {
                            if(i<=c)
                                System.out.print("R ");
                            else
                                System.out.print("LR ");
                        }
                    }
                    else if((ie==is))
                    {
                        if(je>js)
                        {
                        while(js!=je)
                        {
                         js=js+2;
                         c++;
                        }
                        System.out.println(c);
                        for(int i=1;i<=c;i++)
                            System.out.print("R ");
                    }
                        else if(je<js)
                        {
                            while(js!=je)
                        {
                         js=js-2;
                         c++;
                        }
                        System.out.println(c);
                        for(int i=1;i<=c;i++)
                            System.out.print("L ");
                        }
                        else
                            System.out.print(c);
                }
                    else if(je==js)
                    {
                        int d=(Math.abs(ie-is))/4;
                        //System.out.println(a+"      "+d);
                        c=d*2;
                        System.out.println(c);
                        if(ie<is)
                        {
                            for(int i=1;i<=c;i++)
                            {
                                if(i%2==0)
                                    System.out.print("UR ");
                                else
                                    System.out.print("UL ");
                            }
                        }
                        else if(ie>is)
                        {
                          for(int i=1;i<=c;i++)
                            {
                                if(i%2==0)
                                    System.out.print("LL ");
                                else
                                    System.out.print("LR ");
                            }  
                        }
                    }
                    
            }
                else
                    System.out.println("Impossible");
        }
            else
                System.out.println("Impossible");
        }
        else
            System.out.println("Impossible");
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int is = in.nextInt();
        int js = in.nextInt();
        int ie = in.nextInt();
        int je = in.nextInt();
        printShortestPath(n, is, js, ie, je);
        in.close();
    }
}