#include <bits/stdc++.h>
using namespace std;

long long dis[201][201];
bool vis[201][201];
long long n;
long long dx[]={-2,-2,0,2,2,0};
long long dy[]={-1,1,2,1,-1,-2};
string mov[]={"UL","UR","R","LR","LL","L"};

void bfs(long long x, long long y){
	vis[x][y]=true;
	dis[x][y]=0;
	deque<pair<long long, long long> > Q;
	Q.push_back(make_pair(x,y));
	while(!Q.empty()){
		pair<long long, long long> par=Q.front();
		for(long long i=0; i<6; i++){
			long long u=par.first+dx[i];
			long long v=par.second+dy[i];
			if(u>=0 && v>=0 && u<n && v<n && !vis[u][v]){
				vis[u][v]=true;
				dis[u][v]=1+dis[par.first][par.second];
				Q.push_back(make_pair(u,v));
			}
		}
		Q.pop_front();
	}
	return;
}

int main(){
	cin>>n;
	long long x1,y1,x2,y2;
	cin>>x1>>y1>>x2>>y2;
	bfs(x1,y1);
	if(!vis[x2][y2]){
		cout<<"Impossible"<<endl;
	}else{
		/*for(long long i=0; i<n; i++){
			for(long long j=0; j<n; j++){
				cout<<dis[i][j]<<" ";
			}
			cout<<endl;
		}*/
		cout<<dis[x2][y2]<<endl;
		vector<string> rep;
		while(dis[x2][y2]!=0){
			for(long long i=5; i>=0; i--){
				long long u=x2-dx[i];
				long long v=y2-dy[i];
				if(u>=0 && v>=0 && u<n && v<n && dis[u][v]+1==dis[x2][y2]){
					x2=u;
					y2=v;
					rep.push_back(mov[i]);
					//cout<<mov[i]<<endl;
					break;
				}
			}
		}
		long long sz=rep.size();
		for(long long i=sz-1; i>=0; i--){
			cout<<rep[i]<<" ";
		}
		cout<<endl;
	}
	return 0;
}