#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,a,b,c,d;
ll mem[201][210];
bool vis[201][201];
bool check(ll x,ll y)
{
	if(x>=0 && x<n && y>=0 && y<n)
	return 1;
	return 0;
}
ll fun(ll x,ll y)
{
//	cout<<x<<y<<" ";
	if(x==c && y==d)
	return 0;
	if(mem[x][y])
	return mem[x][y];
	vis[x][y]=1;
	ll z=INT_MAX;
	if(check(x-2,y-1) && !vis[x-2][y-1] && fun(x-2,y-1)<z)
	z=fun(x-2,y-1);
	if(check(x-2,y+1) && !vis[x-2][y+1] && fun(x-2,y+1)<z)
	z=fun(x-2,y+1);
	if(check(x,y+2) && !vis[x][y+2] && fun(x,y+2)<z)
	z=fun(x,y+2);
	if(check(x+2,y+1) && !vis[x+2][y+1] && fun(x+2,y+1)<z)
	z=fun(x+2,y+1);
	if(check(x+2,y-1) && !vis[x+2][y-1] && fun(x+2,y-1)<z)
	z=fun(x+2,y-1);
	if(check(x,y-2) && !vis[x][y-2] && fun(x,y-2)<z)
	z=fun(x,y-2);
	mem[x][y]=1+z;
	//cout<<x<<" "<<y<<" "<<mem[x][y]<<endl;
	vis[x][y]=0;
	return 1+z;
}
int main()
{
	cin>>n>>a>>b>>c>>d;
	ll e=fun(a,b);
	if(e>INT_MAX)
	{
	cout<<"Impossible\n";
	return 0;
	}
	else
	cout<<e<<endl;
	ll f=e-1;
	queue<string>q;
	ll x=a,y=b;
	while(f>=0)
	{
		if(check(x-2,y-1) && mem[x-2][y-1]==f)
		{
		q.push("UL");
		x-=2;
		y-=1;
		}
		else if(check(x-2,y+1) && mem[x-2][y+1]==f)
		{
		q.push("UR");
		x-=2;
		y+=1;
		}
		else if(check(x,y+2) && mem[x][y+2]==f)
		{
		q.push("R");
		y+=2;
		}
		else if(check(x+2,y+1) && mem[x+2][y+1]==f)
		{
		q.push("LR");
		x+=2;
		y+=1;
		}
		else if(check(x+2,y-1) && mem[x+2][y-1]==f)
		{
		q.push("LL");
		x+=2;
		y-=1;
		}
		else 
		{
		q.push("L");
		y-=2;
		}
	//	cout<<x<<y;
		f--;
	}
	while(!q.empty())
	{
		cout<<q.front()<<" ";
		q.pop();
	}
}