import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.List;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Collections;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Solution {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		RedKnightsShortestPath solver = new RedKnightsShortestPath();
		solver.solve(1, in, out);
		out.close();
	}

	static class RedKnightsShortestPath {
		public void solve(int testNumber, InputReader in, PrintWriter out) {
			int n = in.nextInt();
			int r1 = in.nextInt();
			int c1 = in.nextInt();
			int r2 = in.nextInt();
			int c2 = in.nextInt();

			String[] m = {"UL", "UR", "R", "LR", "LL", "L"};
			int[] dr = {-2, -2, 0, 2, 2, 0};
			int[] dc = {-1, 1, 2, 1, -1, -2};

			List<Integer> moves = new ArrayList<>();

			for (int step = 0; step < 1000; step++) {
				int best = Integer.MAX_VALUE;
				int bestM = -1;
				for (int i = 0; i < dr.length; i++) {
					int r = r1 + dr[i];
					int c = c1 + dc[i];
					int d = Math.abs(r2 - r) + Math.abs(c2 - c);
					if (best > d) {
						best = d;
						bestM = i;
					}
				}
				r1 += dr[bestM];
				c1 += dc[bestM];
				moves.add(bestM);
				if (r1 == r2 && c1 == c2)
					break;
			}

			if (moves.size() == 1000) {
				out.println("Impossible");
			} else {
				Collections.sort(moves);
				out.println(moves.size());
				for (int move : moves) {
					out.print(m[move] + " ");
				}
			}
		}

	}

	static class InputReader {
		final InputStream is;
		final byte[] buf = new byte[1024];
		int pos;
		int size;

		public InputReader(InputStream is) {
			this.is = is;
		}

		public int nextInt() {
			int c = read();
			while (isWhitespace(c))
				c = read();
			int sign = 1;
			if (c == '-') {
				sign = -1;
				c = read();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = read();
			} while (!isWhitespace(c));
			return res * sign;
		}

		int read() {
			if (size == -1)
				throw new InputMismatchException();
			if (pos >= size) {
				pos = 0;
				try {
					size = is.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (size <= 0)
					return -1;
			}
			return buf[pos++] & 255;
		}

		static boolean isWhitespace(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

	}
}