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) {
		if (i_start % 2 != i_end % 2) {
			System.out.println("Impossible");
			return;
		}
		int i = i_start;
		int j = j_start;
		int exI = -1, exJ = -1, aI = -1, aJ = -1;
		StringBuilder result = new StringBuilder();
		int counter = 0;
		while (true) {
			aI = i; aJ = j;
			if (i_end < i && j_end <= j) {
				i -= 2;
				j -= 1;
				result.append("UL ");
				++counter;
			} else if (i_end < i && j_end > j) {
				i -= 2;
				j += 1;
				result.append("UR ");
				++counter;
			} else if (i_end == i && j_end > j) {
				j += 2;
				result.append("R ");
				++counter;
			} else if (i_end > i && j_end >= j) {
				i += 2;
				j += 1;
				result.append("LR ");
				++counter;
			} else if (i_end > i && j_end < j) {
				i += 2;
				j -= 1;
				result.append("LL ");
				++counter;
			} else if (i_end == i && j_end < j) {
				j -= 2;
				result.append("L ");
				++counter;
			} else if (i == i_end && j == j_end) {
				break;
			}
			if (i == exI && j == exJ) {
				System.out.println("Impossible");
				return;
			} else {
				exI = aI;
				exJ = aJ;
			}
		}
		System.out.println(counter + "\n" + result.toString());
	}

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