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

public class Solution {
    
    static int dist(int x1,int y1,int x2,int y2)
    {
        return (int)Math.sqrt(Math.pow(x1-x2,2)+Math.pow(y1-y2,2));
    }

    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.
        String ans = "";
        int flag=0;
        int count=0;
        int begin=0;
        while(true)
        {
            begin=0;
            count++;
            //System.out.println(count+" "+i_start+" "+j_start);
            if(i_start==i_end&&j_start==j_end)
            {
                 break;
            }
            if(i_start-2>=0&&j_start-1>=0&&begin==0)
            {
                if(dist(i_start-2,j_start-1,i_end,j_end)<dist(i_start,j_start,i_end,j_end))
                {
                    ans += "UL ";   
                    i_start=i_start-2;
                    j_start=j_start-1;   
                    begin=1;
                    //System.out.println(i_start+" "+j_start);
                }
            }
            if(i_start-2>=0&&j_start+1<=n-1&&begin==0)
            {
                if(dist(i_start-2,j_start+1,i_end,j_end)<dist(i_start,j_start,i_end,j_end))
                {
                    ans+="UR ";   
                    i_start=i_start-2;
                    j_start=j_start+1;     
                    begin=1;           
                    //System.out.println(i_start+" "+j_start);
                }
            }
            if(j_start+2<=n-1&begin==0)
            {
                if(dist(i_start,j_start+2,i_end,j_end)<dist(i_start,j_start,i_end,j_end))
                {
                    begin=1;
                    ans+="R ";   
                    i_start=i_start;
                    j_start=j_start+2;                
                    //System.out.println(i_start+" "+j_start);
                }
            }
            if(i_start+2<=n-1&&j_start+1<=n-1&&begin==0)
            {
                if(dist(i_start+2,j_start+1,i_end,j_end)<dist(i_start,j_start,i_end,j_end))
                {
                    ans+="LR ";   
                    begin=1;
                    i_start=i_start+2;
                    j_start=j_start+1;      
                    //System.out.println(i_start+" "+j_start);
                }
            }
            if(i_start+2<=n-1&&j_start-1>=0&&begin==0)
            {
                if(dist(i_start+2,j_start-1,i_end,j_end)<dist(i_start,j_start,i_end,j_end))
                {
                    ans+="LL ";   
                    begin=1;
                    i_start=i_start+2;
                    j_start=j_start-1;     
                    //System.out.println(i_start+" "+j_start);
                }
            }
            if(j_start-2>=0&&begin==0)
            {
                if(dist(i_start,j_start-2,i_end,j_end)<dist(i_start,j_start,i_end,j_end))
                {
                    ans+="L ";   
                    begin=1;
                    i_start=i_start;
                    j_start=j_start-2;     
                    //System.out.println(i_start+" "+j_start);
                }
            }
            if(begin==0) 
            {
                flag=1;
                System.out.println("Impossible");
                break;
            }
        }
        if(flag!=1)
        {
            System.out.println(count-1);
            System.out.println(ans);
        }
        
    }

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