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.
        if((i_start + i_end)%2!=0)
        {
            System.out.println("Impossible");
            return;
        }
        long nm = 0;
        ArrayList<String> mvl = new ArrayList<String>();
        while(i_start!=i_end || j_start!=j_end)
        {
            if(i_start==i_end)
            {
                
                if((j_start + j_end)%2!=0)
                {
                    System.out.println("Impossible");
                    return;
                }
                else
                {
                    while(j_start!=j_end)
                    {
                        if(j_start<j_end)
                        {
                            j_start+=2;
                            nm++;
                            mvl.add("R");
                        }
                        else
                        {
                            j_start-=2;
                            nm++;
                            mvl.add("L");
                        }    
                    }    
                }    
                
            }
            else
            {
                //System.out.println("("+i_start+","+j_start+")"+"("+i_end+","+j_end+")");   
                if(i_start<i_end && j_start<=j_end)
                {
                    
                    i_start+=2;
                    j_start+=1;
                    nm++;
                    mvl.add("LR");
                }
                else
                {
                    if(i_start<i_end && j_start>=j_end)
                    {
                        i_start+=2;
                        j_start-=1;
                        nm++;
                        mvl.add("LL");
                    }
                    else
                    {
                        if(i_start>i_end && j_start>=j_end)
                        {
                            i_start-=2;
                            j_start-=1;
                            nm++;
                            mvl.add("UL");
                        }
                        else
                        {
                            i_start-=2;
                            j_start+=1;
                            nm++;
                            mvl.add("UR");
                        }    
                    }    
                }    
            }    
            
        }
        
        System.out.println(nm);
        for(String s : mvl)
        System.out.print(s+" ");    
        
        
    }

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