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

public class Solution {
	// UL, UR, R, LR, LL, L
	static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {

		if ((i_start - i_end) % 2 != 0) {
			System.out.println("Impossible");
		} else if ((((i_start - i_end) / 2) + (j_start - j_end)) % 2 != 0) {
			System.out.println("Impossible");
		} else {
			int count = Math.abs(i_end - i_start) / 2;
			if (Math.abs(i_end - i_start) / 2 < Math.abs(j_start - j_end)) {
				count = count + (Math.abs(j_start - j_end) - Math.abs(i_end - i_start) / 2) / 2;
			}
			System.out.println(count);
			printPath(n, i_start, j_start, i_end, j_end);
		}
	}

	private static void printPath(int n, int i_start, int j_start, int i_end, int j_end) {
		int x = i_start;
		int y = j_start;
		if (i_start == i_end) {
			if (j_start > j_end) {
				while (y != j_end) {
					System.out.print("L ");
					y = y - 2;
				}
			} else {
				while (y != j_end) {
					System.out.print("R ");
					y = y + 2;
				}
			}
		} else if (i_start > i_end) {

			if (j_start > j_end) {
				System.out.print("UL ");
				x = x - 2;
				y = y - 1;
				printPath(n, x, y, i_end, j_end);
			} else if (j_start < j_end) {
				if (j_end - j_start >= (i_start - i_end) / 2 || y == 0) {
					System.out.print("UR ");
					x = x - 2;
					y = y + 1;
					printPath(n, x, y, i_end, j_end);
				} else {
					System.out.print("UL ");
					x = x - 2;
					y = y - 1;
					printPath(n, x, y, i_end, j_end);
				}

			} else {
				if (y != 0) {
					System.out.print("UL ");
					x = x - 2;
					y = y - 1;
					printPath(n, x, y, i_end, j_end);
				} else {
					System.out.print("UR ");
					x = x - 2;
					y = y + 1;
					printPath(n, x, y, i_end, j_end);
				}
			}

		} else if (i_start < i_end) {
			if (j_start > j_end) {

				if (j_start - j_end >= (i_end - i_start) / 2 || y == n - 1) {
					System.out.print("LL ");
					x = x + 2;
					y = y - 1;
					printPath(n, x, y, i_end, j_end);
				} else {
					System.out.print("LR ");
					x = x + 2;
					y = y + 1;
					printPath(n, x, y, i_end, j_end);
				}

			} else if (j_start < j_end) {
				if (j_end - j_start > (i_end - i_start) / 2) {
					System.out.print("R ");
					y = y + 2;
					printPath(n, x, y, i_end, j_end);
				} else {
					System.out.print("LR ");
					x = x + 2;
					y = y + 1;
					printPath(n, x, y, i_end, j_end);
				}

			} else {
				if (y != n - 1) {
					System.out.print("LR ");
					x = x + 2;
					y = y + 1;
					printPath(n, x, y, i_end, j_end);
				} else {
					System.out.print("LL ");
					x = x + 2;
					y = y - 1;
					printPath(n, x, y, i_end, j_end);
				}
			}
		}
	}

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

}