#include <bits/stdc++.h>
using namespace std;
typedef long long				ll;
typedef pair<int,int >			pii;
template<typename T>
using V = vector<T>;
#define SYNC					ios_base::sync_with_stdio(0);cin.tie(0);
#define rep(i,b)				for(int i=0;i<b;i++)
#define repn(i,n)				for(int i=1;i<=n;i++)
#define ALL(x)					(x).begin(),(x).end()
#define fi						first
#define se						second
#define pb						push_back
#define dzx						cerr<<"here";
const ll MOD=1e9+7,INF=0x3F3F3F3F3F3F3F3F;
const int inf=0x3F3F3F3F;
#define piii pair<int,pii>
/* Equinox */
int is,js,ie,je;
pii dist[201][201];
priority_queue<piii,V<piii>,greater<piii> > q;
V<pii> moves={{-2,-1},{-2,1},{0,2},{2,1},{2,-1},{0,-2}};
V<string> type={"UL","UR","R","LR","LL","L"};
int32_t main(){SYNC
	int n;
	memset(dist,0x3F,sizeof dist);
	cin>>n;
	cin>>is>>js>>ie>>je;
	dist[ie][je].fi=0;
	q.push({0,{ie,je}});
	while(!q.empty()){
		auto cur=q.top();
		q.pop();
		auto cor=cur.se;
		if(dist[cur.se.fi][cur.se.se].fi<cur.fi)
			continue;
		for(int j=0;j<(int)moves.size();j++){
			auto i=moves[j];
			if((cor.fi+i.fi)<0 || (cor.fi+i.fi) >=n)
				continue;
			if(cor.se+i.se<0 || cor.se+i.se >=n)
				continue;
			if(dist[cor.fi+i.fi][cor.se+i.se].fi>(cur.fi+1)){
				q.push({cur.fi+1,{cor.fi+i.fi,cor.se+i.se}});
				dist[cor.fi+i.fi][cor.se+i.se].fi=cur.fi+1;
				dist[cor.fi+i.fi][cor.se+i.se].se=j;
			}
		}
	}
	if(dist[is][js].fi==inf){
		cout<<"Impossible";
		return 0;
	}
	int cd=dist[is][js].fi;
	pii cur={is,js};;
	cout<<cd<<"\n";
	int tt=0;
	while(cur!=make_pair(ie,je)){
		for(int i=0;i<(int)moves.size();i++){
			auto j=moves[i];
			if((cur.fi+j.fi)<0 || (cur.fi+j.fi) >=n)
				continue;
			if(cur.se+j.se<0 || cur.se+j.se >=n)
				continue;
			if(dist[cur.fi+j.fi][cur.se+j.se].fi<cd){
				cd--;
				cur.fi+=j.fi;
				cur.se+=j.se;
				cout<<type[i]<<" ";
				break;
			}
		}
	}
	return 0;
}