#include <bits/stdc++.h>
using namespace std;
#define mp(a,b) make_pair(a,b)
#define ff first
#define setp setprecision(12)<<fixed
#define ss second
#define fori(v) for(int i=0; i<v; i++)
#define forj(v) for(int j=0; j<v; j++)
#define fork(v) for(int k=0; k<v; k++)
#define forl(v) for(int l=0; l<v; l++)
#define fort(v) for(int t=0; t<v; t++)
#define forz(v) for(int z=0; z<v; z++)
#define lli long long int
#define double long double
#define MAX 100010
#define ch 560
#define sz 30
int inf = pow(10,9);
lli modulo = inf+7;
double eps = 1e-10;
ifstream in;
ofstream out;
int dx[6] = {-2,-2,0,2,2,0};
int dy[6] = {-1,1,2,1,-1,-2};
int main(){
	int n,s1,s2,d1,d2;
	cin>>n>>s1>>s2>>d1>>d2;
	string path[6] = { "UL", "UR", "R", "LR", "LL", "L"};
	int arr[n][n];
	int wh[n][n];
	string how[n][n];
	fori(n)
		forj(n)
			arr[i][j] = -1;
	arr[s1][s2] = 1;
	vector<int> qow(1,s1*n+s2);
	fori(qow.size()){
		int x = qow[i] / n , y = qow[i] % n;
		fork(6){
			int x1 = x + dx[k], y1 = y + dy[k];
			if(x1>-1 && y1>-1 && x1<n && y1<n && arr[x1][y1]==-1){
				arr[x1][y1] = 1;
				wh[x1][y1] = qow[i];
				how[x1][y1] = path[k];
				qow.push_back(x1*n+y1);
			}
		}
	}
	deque<string> all;
	if(arr[d1][d2]==-1)
		cout<<"Impossible";
	else{
		while(d1!=s1 || d2!=s2){
			all.push_front(how[d1][d2]);
			int whe = wh[d1][d2];
			d1 = whe/n, d2 = whe % n;	
		}
		cout<<all.size()<<'\n';
		fori(all.size())
			cout<<all[i]<<' ';
	}
}