#include <bits/stdc++.h>

using namespace std;

#define NO {puts("Impossible");return 0;}

int n,i,j,k,t,a,b,c,d, m[100000];

int main(){
	scanf("%d", &t);
	scanf("%d %d %d %d", &a, &b, &c, &d);
	if(abs(a-c) & 1)
		NO
	if((abs(abs(d-b)-abs(a-c)/2)) & 1)
		NO
	for(i=0;a!=c||b!=d; i++){
		if(a>c){
			if(b>=d){
				m[i] = 1;
				b-=1;
			}
			else{
				m[i] = 2;
				b+=1;
			}
			a-=2;
		}
		else if(a<c){
			if(b<=d){
				m[i] = 4;
				b+=1;
			}
			else{
				m[i] = 5;
				b-=1;
			}
			a+=2;
		}
		else{
			if(b<=d){
				m[i] = 3;
				b+=2;
			}
			else{
				m[i] = 6;
				b-=2;
			}
		}
	}
	sort(m, m+i);
	printf("%d\n", i);
	for(j=0;j<i;j++){
		switch(m[j]){
			case 1 : printf("UL ");
				break;
			case 2 : printf("UR ");
				break;
			case 3 : printf("R ");
				break;
			case 4 : printf("LR ");
				break;
			case 5 : printf("LL ");
				break;
			case 6 : printf("L ");
				break;
		}
	}
	return 0;
}