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) 
    {
        String dir="";
        int c=0;
        int pi=is,pj=js;
        
        if(is==ie && js==je)
            System.out.println(0);
        else if(((Math.abs(is-ie))%2!=0)||(Math.abs(is-ie)%4!=0 && js==je)||((is==ie)&&(Math.abs(js-je)%2!=0)))
        {
            System.out.println("Impossible");
        }
        else if(pi!=ie)
        {
            while(pi!=ie)
            {
                c++;
                if(pi<ie )
                {
                    pi=pi+2;
                    if(pj<=je)
                    {
                        dir=dir+"LR ";
                        pj++;
                    }
                    else
                    {
                        dir=dir+"LL ";
                        pj--;
                    }
                }
                else
                {
                    pi=pi-2;
                    if(pj<=je)
                    {
                        dir=dir+"UR ";
                        pj++;
                    }
                    else
                    {
                        dir=dir+"UL ";
                        pj--;
                    }
                }
            }
            if(pj==je)
            {
                System.out.println(c+"\n"+dir);
            }
            if(pj!=je)
            {
                if(Math.abs(pj-je)%2==0)
                {
                    while(pj!=je)
                    {
                        c++;
                        if(pj<=je)
                        {
                            pj=pj+2;
                            dir=dir+"R ";
                        }
                        else
                        {
                            pj=pj-2;
                            dir=dir+"L ";
                        }
                    }
                  System.out.println(c+"\n"+dir);
                }
                else
                {
                    System.out.println("Impossible");
                }
            }
        }
        else if((pi==ie)&&(pj!=je))
        {
            if(Math.abs(pj-je)%2==0)
            {
                while(pj!=je)
                {
                    c++;
                    if(pj<=je)
                    {
                        pj=pj+2;
                        dir=dir+"R ";
                    }
                    else
                    {
                        pj=pj-2;
                        dir=dir+"L ";
                    }
                }
                  System.out.println(c+"\n"+dir);
            }
            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 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();
    }
}