/* ****Enigma27**** */

#include<bits/stdc++.h>
#define ll          long long
#define pb          push_back
#define	endl		'\n'
#define pii         pair<ll int,ll int>
#define vi          vector<ll int>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define hell        1000000007
#define lbnd        lower_bound
#define ubnd        upper_bound
#define bs          binary_search
#define mp          make_pair
#define ios	    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll t,i,j,k,x,xx,y,yy,ans=0,n,UL=0,UR=0,R=0,LR=0,LL=0,L=0;
vector<string> v;
int main()
{	//ios
	cin>>n;
	cin>>y>>x>>yy>>xx;
	if(abs(y-yy)&1 || abs(abs(x-xx)-(abs(y-yy)/2))&1) {cout<<"Impossible\n";return 0;}
	k=(abs(y-yy));j=abs(x-xx);
	ll l=min(k/2,j);
	if(yy<y){
		 if(x>xx) UL+=l;
		 else UR+=l;
		 j-=l;
		 k-=2*l;
		 UL+=k/4;
		 UR+=k/4;
		 if(x>xx) L+=j/2;
		 else R+=j/2;
	}
	else {
		 if(x>xx) LL+=l;
		 else LR+=l;
		 j-=l;
		 k-=2*l;
		 LL+=k/4;
		 LR+=k/4;
		 if(x>xx) L+=j/2;
		 else R+=j/2;
	}
	cout<<UL+UR+R+LR+LL+L<<endl;
	while(UL) cout<<"UL ",UL--;
	while(UR) cout<<"UR ",UR--;
	while(R) cout<<"R ",R--;
	while(LR) cout<<"LR ",LR--;
	while(LL) cout<<"LL ",LL--;
	while(L) cout<<"L ",L--;
	return 0;
}