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

public class Solution {

    static void printShortestPath(int z, int i, int j, int k, int l) {
        //  Print the distance along with the sequence of moves.
            int disti=Math.abs(j-l);
            int distj=Math.abs(i-k);
            int tot=0;
                    if(distj%2!=0)
                    {
                        System.out.println("Impossible");
                        return;
                    }
                    int x=distj/2;
                    tot+=x;
                    if(j!=l)
                    {disti-=x;tot+=(disti/2);}
                    if(disti%2!=0)
                    {
                        System.out.println("Impossible");
                        return;
                    }
                System.out.println(tot);
                    for(int n=0;n<tot;n++)
                    {    
                        if(j<=l&&i<k)
                        {System.out.print("LR ");l--;k=k-2;}
                        else if(j<=l&&i>k)
                        {System.out.print("UR ");l--;k=k+2;}
                        else if(i==k&&j<l)
                        {System.out.print("R ");l=l-2;}
                        else if(j>=l&&i<k)
                        {System.out.print("LL ");l++;k=k-2;}
                        else if(j>=l&&i>k)
                        {System.out.print("UL ");l++;k=k+2;}
                        else if(i==k&&j>l)
                        {System.out.print("L ");l=l+2;}

                        
                                               
                    }
    }



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