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.
        String str = "";
        int count = 0;
            while(j_start < j_end && i_start >= i_end)
            {
                if(i_start-2 < 0)
                {
                    if(j_start+2 <= (n-1))
                    {
                        str += "R ";
                        j_start += 2;
                        count++;
                    }
                }
                else
                {
                    str += "UR ";
                    i_start -= 2;
                    j_start += 1;
                    count++;
                }
            }
            while(j_start > j_end && i_start >= i_end)
            {
                if(i_start-2 < 0)
                {
                    if(j_start-2 >= 0)
                    {
                        str += "L ";
                        j_start -= 2;
                        count++;
                    }
                }
                else
                {
                    str += "UL ";
                    i_start -= 2;
                    j_start -= 1;
                    count++;
                }
            }
            while(j_start > j_end && i_start <= i_end)
            {
                if(i_start+2 > (n-1))
                {
                    if(j_start-2 >= 0)
                    {
                        str += "L ";
                        j_start -= 2;
                        count++;
                    }
                }
                else
                {
                    str += "LL ";
                    i_start += 2;
                    j_start -= 1;
                    count++;
                }
            }
            while(j_start < j_end && i_start <= i_end)
            {
                if(i_start+2 > (n-1))
                {
                    if(j_start+2 <= (n-1))
                    {
                        str += "R ";
                        j_start += 2;
                        count++;
                    }
                }
                else
                {
                    str += "LR ";
                    i_start += 2;
                    j_start += 1;
                    count++;
                }
            }
            if(j_start == j_end)
            {
                if(i_start < i_end)
                {
                    while(i_start < i_end)
                    {
                        if(i_start + 4 <= (n-1))
                        {
                            i_start += 4;
                            str += "LR LL ";
                            count += 2;
                        }
                        else
                            break;
                    }
                }
                else if(i_start > i_end)
                {
                    while(i_start > i_end)
                    {
                        if(i_start - 4 >= 0)
                        {
                            i_start -= 4;
                            str += "UR UL ";
                            count += 2;
                        }
                        else
                            break;
                    }
                }
            }
            if(i_start == i_end && j_start == j_end)
                System.out.println(count + "\n" + str.substring(0, str.length()-1));
            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();
    }
}