#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define all(v)           ((v).begin()), ((v).end())
#define sz size()
#define clr(v,d)         memset(v,d,sizeof(v))
#define rep(i, v)        for(int i=0;i<(v).sz;++i)
#define lp(i, n)         for(int i=0;i<(int)(n);++i)
#define lpi(i, j, n)     for(int i=(j);i<(int)(n);++i)
#define lpd(i, j, n)     for(int i=(j);i>=(int)(n);--i)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define sci(a)	scanf("%d",&a)
#define scii(a, b)	scanf("%d%d",&a, &b)
#define pri(a)	printf("%d\n",a)
#define prii(a, b)	printf("%d %d\n",a, b)
#define DB1(a)          std::cout<<#a<<"="<<(a)<<endl
#define DB2(a,b)        std::cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<endl
#define DB3(a,b,c)      std::cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<endl
#define DB4(a,b,c,d)    std::cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<endl
#define DB5(a,b,c,d,e)  std::cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<endl
typedef pair<int, int> pii;
typedef long long ll;
const ll  inf = 1000000000000000000LL;
const double EPS = 1e-9;
const ll mod = 1000000007ll;
#define PI acos(-1)

const int maxn = 300500;


int vis[550][550], prv[550][550];
int n;

int dx[] = { -2, -2, 0, 2, 2, 0 };
int dy[] = { -1, 1, 2, 1, -1, -2 };

string mo[] = {  "UL", "UR", "R", "LR", "LL", "L" }; 


void BFS(int si,int sj,int ti,int tj){
	queue<int> q;
	q.push(si); q.push(sj);
	memset(prv, -1, sizeof(prv));
	vis[si][sj] = 1;
	while (!q.empty()){
		int i = q.front(); q.pop();
		int j = q.front(); q.pop();
		if (i == ti && j == tj) break;
		for (int k = 0; k < 6; k++){
			int ni = i + dx[k], nj = j + dy[k];
			if (ni < 0 || nj < 0 || ni >= n || nj >= n || vis[ni][nj]) continue;
			vis[ni][nj] = vis[i][j] + 1;
			prv[ni][nj] = k;
			q.push(ni), q.push(nj);
		}
	}
	if (vis[ti][tj] == 0) {
		cout <<"Impossible"; return ;
	}
	cout << vis[ti][tj] - 1 << "\n";
	vector<int> r;
	while (prv[ti][tj] != -1){
		int k = prv[ti][tj];
		r.push_back(k);
		ti += -dx[k];
		tj += -dy[k];
	}
	reverse(r.begin(), r.end());
	for (int i = 0; i < r.size(); i++)
		cout << mo[r[i]] << " ";
}

int main(){
	cin >> n;
	int i, j, i1, j1; cin >> i >> j >> i1 >> j1;
	BFS(i, j, i1, j1);
}