#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=n-1;i>=(0);i--)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define eall(v) unique(all(v), v.end())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;


int dy[] = {2, 0, -2, -2, 0, 2};
int dx[] = {1, 2, 1, -1, -2, -1};
vector<string> s = {"LR", "R", "UR", "UL", "L", "LL"};

bool used[210][210];

int main(void) {
	int n; cin >> n;
	int sx, sy, tx, ty; cin >> sy >> sx >> ty >> tx;
	queue<pair<pair<int, int>, vector<int>>> que;
	vector<int> dd {};
	que.push(mp(mp(sy, sx), dd)); // ??
	used[sy][sx] = true;

	while(!que.empty()) {
		auto t = que.front(); que.pop();
		int y = t.fi.fi, x = t.fi.se;
		auto v = t.se; // ?

		if(y == ty && x == tx) {
			printf("%d\n", v.size());
			for(auto u : v) {
				cout << s[u] << " ";
			}
			printf("\n");
			return 0;
		}

		rep(i, 6)  {
			int ny = y + dy[i], nx = x + dx[i];
			if(!(0 <= ny && ny < n && 0 <= nx && nx < n)) continue;
			if(used[ny][nx]) continue;
			used[ny][nx] = true;
			auto tmpv = v;
			tmpv.pb(i);
			que.push(mp(mp(ny, nx), tmpv)); // ?
		}
	}
	printf("Impossible\n");
	return 0;
}