#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1e18
#define pb push_back
#define F first
#define S second
#define ll long long
#define pi pair<ll,ll>
#define sc(x) scanf("%lld",&x)
ll n;
ll parent[40001];
ll dist[40001];
ll mov[40001];
ll y[]={-1,+1,2,1,-1,-2};
ll x[]={-2,-2,0,2,2,0};
bool valid(ll x,ll y){
	if(x<n && y<n && x>=0 && y>=0){
		return true;
	}
	else{
		return false;
	}
}
vector<ll> ans;
int main(){
	ll x1,y1,x2,y2,xx,yy;
	sc(n);
	scanf("%lld%lld%lld%lld",&x1,&y1,&x2,&y2);
	for(int i=0;i<n*n;i++){
		dist[i]=INF;
	}
	queue<ll> q;
	q.push(x1*n+y1);
	dist[x1*n+y1]=0;
	while(!q.empty()){
		xx=q.front()/n;
		yy=q.front()%n;
		// cout<<xx<<" "<<yy<<endl;
		for(int i=0;i<6;i++){
			if(valid(xx+x[i],yy+y[i]) && dist[(xx+x[i])*n+(yy+y[i])]==INF){
				dist[(xx+x[i])*n+(yy+y[i])]=dist[q.front()]+1;
				parent[(xx+x[i])*n+(yy+y[i])]=q.front();
				mov[(xx+x[i])*n+(yy+y[i])]=i;
				q.push((xx+x[i])*n+(yy+y[i]));
			}
		}
		q.pop();
	}
	if(dist[x2*n+y2	]==INF){
		cout<<"Impossible"<<endl;
	}
	else{
		cout<<dist[x2*n+y2]<<endl;
		ll curr=x2*n+y2;
		while(curr!=(x1*n+y1)){
			ans.push_back(mov[curr]);
			curr=parent[curr];
		}
		for(int i=ans.size()-1;i>=0;i--){
			if(ans[i]==0){
				cout<<"UL ";
			}
			else if(ans[i]==1){
				cout<<"UR ";
			}
			else if(ans[i]==2){
				cout<<"R ";
			}
			else if(ans[i]==3){
				cout<<"LR ";
			}
			else if(ans[i]==4){
				cout<<"LL ";
			}
			else{
				cout<<"L ";
			}
		}
	}


}