#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define slld(x) scanf("%lld", &x)
#define plld(x) printf("%lld\n", x)
#define nl 	putchar('\n')
#define ft first
#define sd second
#define mp make_pair
#define pb push_back

const ll MAX = (ll)(1e5+8);
const ll MOD = (ll)(1e9 + 7);
const ll inf = (ll)(1e15);

//UL, UR, R, LR, LL, L

char move_typ[6][4] = {"UL", "UR", "R", "LR", "LL", "L"};
ll dist[202][202], n;
pair<ll, ll> tmp, s, e;
pair< pair<ll, ll>, ll> par[203][203];
pair<ll, ll> moves[6] = {mp(-2, -1), mp(-2, 1), mp(0, 2), mp(2, 1), mp(2, -1), mp(0, -2)};

inline bool is_val(ll x, ll y){
	if(x>=0 && x<n && y>=0 && y<n)
		return true;
	return false;
}

bool operator<(pair<ll, ll> a, pair<ll, ll> b){
	return dist[a.ft][a.sd] > dist[b.ft][b.sd];
}

priority_queue< pair<ll, ll> > q;

void dijkstra(pair<ll, ll> x){
	ll i, j, k;
	ll dx, dy;

	dist[x.ft][x.sd] = 0;

	for(i=0; i<6; i++){
		dx = moves[i].ft, dy = moves[i].sd;
		dx = dx+x.ft, dy = dy+x.sd;
		if(is_val(dx, dy) && dist[dx][dy] > dist[x.ft][x.sd]+1){
			dist[dx][dy] = dist[x.ft][x.sd]+1;
			q.push(mp(dx, dy));
			par[dx][dy] = mp(mp(x.ft, x.sd), i);
		}	
	}
	q.push(x);

	while(!q.empty()){
		tmp = q.top();
		q.pop();
		//printf("%lld %lld\n", tmp.ft, tmp.sd);
		for(i=0; i<6; i++){
			dx = moves[i].ft, dy = moves[i].sd;
			dx = dx+tmp.ft, dy = dy+tmp.sd;
			if(is_val(dx, dy) && dist[dx][dy] > dist[tmp.ft][tmp.sd]+1){
				dist[dx][dy] = dist[tmp.ft][tmp.sd]+1;
				q.push(mp(dx, dy));
				par[dx][dy] = mp(mp(tmp.ft, tmp.sd), i);
			}	
		}	
	}
}

vector< ll > stk;

void get_moves(){
	tmp = e;
	while(tmp != s){
		stk.pb(par[tmp.ft][tmp.sd].sd);
		tmp = par[tmp.ft][tmp.sd].ft;
	}
    sort(stk.begin(), stk.end());
}

void print_moves(){
	ll i;
    for(i=0; i<stk.size(); i++)
		printf("%s ", move_typ[stk[i]]);
	nl;
}

int main() {
	ll i, j, k;
	slld(n);
	for(i=0; i<n; i++)
		for(j=0; j<n; j++)
			dist[i][j] = inf;


	slld(s.ft), slld(s.sd);
	slld(e.ft), slld(e.sd);	
	dijkstra(s);
	if(dist[e.ft][e.sd] == inf)
		printf("Impossible\n");
	else{
		plld(dist[e.ft][e.sd]);
		get_moves();
		print_moves();
	}	
	return 0;
}