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

#define MAX 209

int dp[MAX][MAX]; string str;
queue<pair<int,int> >Q;
pair<int,int>p[MAX][MAX];

int main(){
	int n,i,j,x,y,x1,y1,x2,y2;
	cin>>n;
	cin>>x1>>y1>>x2>>y2;
	memset(dp,-1,sizeof dp);
	Q.push(make_pair(x1,y1)); dp[x1][y1]=0;
	int flag=0;
	while(!Q.empty()){
		pair<int,int>pii=Q.front();
		Q.pop();
		i=pii.first; j=pii.second;
		if(i==x2&&j==y2){
			flag=1;
			break;
		}
		if(i-2>=0&&j-1>=0&&dp[i-2][j-1]==-1){
			Q.push(make_pair(i-2,j-1));
			dp[i-2][j-1]=dp[i][j]+1;
			p[i-2][j-1]=make_pair(i,j);
		}
		if(i-2>=0&&j+1<n&&dp[i-2][j+1]==-1){
			Q.push(make_pair(i-2,j+1));
			dp[i-2][j+1]=dp[i][j]+1;
			p[i-2][j+1]=make_pair(i,j);
		}
		if(j+2<n&&dp[i][j+2]==-1){
			Q.push(make_pair(i,j+2));
			dp[i][j+2]=dp[i][j]+1;
			p[i][j+2]=make_pair(i,j);
		}
		if(i+2<n&&j+1<n&&dp[i+2][j+1]==-1){
			Q.push(make_pair(i+2,j+1));
			dp[i+2][j+1]=dp[i][j]+1;
			p[i+2][j+1]=make_pair(i,j);
		}
		if(i+2<n&&j-1>=0&&dp[i+2][j-1]==-1){
			Q.push(make_pair(i+2,j-1));
			dp[i+2][j-1]=dp[i][j]+1;
			p[i+2][j-1]=make_pair(i,j);
		}
		if(j-2>=0&&dp[i][j-2]==-1){
			Q.push(make_pair(i,j-2));
			dp[i][j-2]=dp[i][j]+1;
			p[i][j-2]=make_pair(i,j);
		}
	}
	if(flag){
		cout<<dp[x2][y2]<<endl;
		i=x2; j=y2;
		while(i!=x1||j!=y1){
			x=p[i][j].first;
			y=p[i][j].second;
			if(x!=i){
				if(i<x){
					if(j>y){
						str=str+"RU ";
					}
					else{
						str=str+"LU ";
					}
				}
				else{
					if(j>y){
						str=str+"RL ";
					}
					else{
						str=str+"LL ";
					}
				}
			}
			else{
				if(j>y){
					str=str+"R ";
				}
				else{
					str=str+"L ";
				}
			}
			i=x; j=y;
		}
		str.pop_back(); reverse(str.begin(),str.end());
		cout<<str<<endl;
	}
	else{
		cout<<"Impossible"<<endl;
	}
	return 0;
}