import java.util.*;
import java.math.*;
public class Solution 
{
    static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) 
    {
        int i = Math.abs(i_end - i_start);
        int j = Math.abs(j_end - j_start) - (i/2);
        int count = (i/2) + Math.abs(j/2);
        if (i%2 != 0 || j%2 != 0)
            System.out.println("Impossible"); 
        else
        {
            int steps = 0;
            int[] ar = new int[count]; 
            for (int k=0; k<count; k++)
                ar[k] = 9;
            while (i_start != i_end || j_start != j_end)
            {
                if (j_start >= j_end && i_start > i_end)
                {
                    ar[steps] = 1;
                    steps++;
                    i_start -= 2;
                    j_start -= 1;
                }
                else if (j_start < j_end && i_start > i_end)
                {
                    ar[steps] = 2;
                    steps++;
                    i_start -= 2;
                    j_start += 1;
                }
                else if (j_start < j_end && i_start == i_end)
                {
                    ar[steps] = 3;
                    steps++;
                    j_start += 2;
                }
                else if (j_start <= j_end && i_start < i_end)
                {
                    ar[steps] = 4;
                    steps++;
                    i_start += 2;
                    j_start += 1;
                }
                else if (j_start > j_end && i_start < i_end)
                {
                    ar[steps] = 5;
                    steps++;
                    i_start += 2;
                    j_start -= 1;
                }
                else if (j_start > j_end && i_start == i_end)
                {
                    ar[steps] = 6;
                    steps++;
                    j_start -= 2;
                }
                Arrays.sort(ar);
            }
            System.out.println(steps);
            for (int k=0; k<steps; k++)
            {
                if (ar[k] == 1)
                    System.out.print("UL ");
                else if (ar[k] == 2)
                    System.out.print("UR ");
                else if (ar[k] == 3)
                    System.out.print("R ");
                else if (ar[k] == 4)
                    System.out.print("LR ");
                else if (ar[k] == 5)
                    System.out.print("LL ");
                else if (ar[k] == 6)
                    System.out.print("L ");
            }
        }
    }
    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();
    }
}