#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
const int N = 203;
int a[N][N];
int main()
{
	int n;
	scanf("%d", &n);
	int id, jd, is, js;
	vector<string> res;
	scanf("%d %d %d %d", &id, &jd, &is, &js);
	if (((is - id) + (js - jd) / 2) % 2 == 0){
		while (is != id || js!=jd){
			if (is<id){ //upper
				if (js>jd) {
					res.push_back("UR");
					id -= 2; jd += 1;
				}
				else if (js<jd){
					res.push_back("UL");
					id -= 2; jd -= 1;
				}
				else { //js==jd
					if (js + 1 == n) {
						res.push_back("UL");
						id -= 2; jd -= 1;
					}
					else {
						res.push_back("UR");
						id -= 2; jd += 1;
					}
				}
			}
			else if (is>id){
				if (js>jd) {
					res.push_back("LR");
					id += 2; jd += 1;
				}
				else if (js<jd){
					res.push_back("LL");
					id += 2; jd -= 1;
				}
				else{
					if (js + 1 == n) {
						res.push_back("LL");
						id += 2; jd -= 1;
					}
					else {
						res.push_back("LR");
						id += 2; jd += 1;
					}
				}
			}
			else {
				if (js > jd)
				{
					res.push_back("R");
					jd += 2;
				}
				else {
					res.push_back("L");
					jd -= 2;
				}
			}
		}
		cout << res.size() << "\n";
		for (int i = 0; i < res.size(); i++){
			cout << res[i] << " ";
		}
	}
	else printf("Imposible");


	return 0;
}