#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,a,b,c,d,sz,dist[222][222],dx[6]={-2,-2,0,2,2,0},dy[6]={-1,1,2,1,-1,-2};
string s[4444],res[6]={"UL","UR","R","LR","LL","L"};
ll f(ll a, ll b)
{
	ll ans=0;
	while(a!=c||b!=d)
	{
		ans++;
		if(a%2!=c%2)
			return -1;
		if(a==c&&b%2!=d%2)
			return -1;
		if(a>c)
		{
			a-=2;
			if(b==0||b<d)
				b++;
			else
				b--;
		}
		else if(a<c)
		{
			a+=2;
			if(b==0||b<d)
				b++;
			else
				b--;
		}
		else if(b<d)
			b+=2;
		else
			b-=2;
	}
	return ans;
}
int main()
{
	cin>>n>>a>>b>>c>>d;
	for(ll i=0;i<n;i++)
		for(ll j=0;j<n;j++)
			dist[i][j]=f(i,j);
	if(dist[a][b]==-1)
	{
		cout<<"Impossible";
		return 0;
	}
	while(a!=c||b!=d)
		for(ll i=0;i<6;i++)
			if(a+dx[i]>=0&&a+dx[i]<n&&b+dy[i]>=0&&b+dy[i]<n&&dist[a][b]==dist[a+dx[i]][b+dy[i]]+1)
				s[++sz]=res[i],a+=dx[i],b+=dy[i],i=6;
	cout<<sz<<endl;
	for(ll i=1;i<=sz;i++)
		cout<<s[i]<<" ";
}