#include<bits/stdc++.h>
using namespace std;
//nksheokand
bool V[201][201];
int str[201][201];
int main()
{
	int n,x1,y1,x2,y2,x,y;
	scanf("%d%d%d%d%d",&n,&x1,&y1,&x2,&y2);
	for(int i=0;i<n;i++)
	for(int j=0;j<n;j++)
	{
		V[i][j]=false;
		str[i][j]=-1;
	}
	queue<pair<int,int> > Q;
	while(!Q.empty())
	Q.pop();
	V[x2][y2]=true;
	str[x2][y2]=0;
	Q.push(make_pair(x2,y2));
	while(!Q.empty())
	{
		x=Q.front().first;
		y=Q.front().second;
		Q.pop();
		if(y-2>=0 && !V[x][y-2])
		{
			V[x][y-2]=true;
			str[x][y-2]=str[x][y]+1;
			Q.push(make_pair(x,y-2));
		}
		if(y+2<n && !V[x][y+2])
		{
			V[x][y+2]=true;
			str[x][y+2]=str[x][y]+1;
			Q.push(make_pair(x,y+2));
		}
		if(x-2>=0 && y-1>=0 && !V[x-2][y-1])
		{
			V[x-2][y-1]=true;
			str[x-2][y-1]=str[x][y]+1;
			Q.push(make_pair(x-2,y-1));
		}
		if(x-2>=0 && y+1<n && !V[x-2][y+1])
		{
			V[x-2][y+1]=true;
			str[x-2][y+1]=str[x][y]+1;
			Q.push(make_pair(x-2,y+1));
		}
		if(x+2<n && y-1>=0 && !V[x+2][y-1])
		{
			V[x+2][y-1]=true;
			str[x+2][y-1]=str[x][y]+1;
			Q.push(make_pair(x+2,y-1));
		}
		if(x+2<n && y+1<n && !V[x+2][y+1])
		{
			V[x+2][y+1]=true;
			str[x+2][y+1]=str[x][y]+1;
			Q.push(make_pair(x+2,y+1));
		}
	}
	x=x1;
	y=y1;
	if(str[x][y]==-1)
	{
		printf("Impossible\n");
	}
	else
	{
		printf("%d\n",str[x][y]);
		while(str[x][y]!=0)
		{
			if(x-2>=0 && y-1>=0 && str[x-2][y-1]==str[x][y]-1)
			{
				printf("UL ");
				x=x-2;
				y=y-1;
			}
			else if(x-2>=0 && y+1<n && str[x-2][y+1]==str[x][y]-1)
			{
				printf("UR ");
				x=x-2;
				y=y+1;
			}
			else if(y+2<n && str[x][y+2]==str[x][y]-1)
			{
				printf("R ");
				x=x;
				y=y+2;
			}
			else if(x+2<n && y+1<n && str[x+2][y+1]==str[x][y]-1)
			{
				printf("LR ");
				x=x+2;
				y=y+1;
			}
			else if(x+2<n && y-1>=0 && str[x+2][y-1]==str[x][y]-1)
			{
				printf("LL ");
				x=x+2;
				y=y-1;
			}
			else if(y-2>=0 && str[x][y-2]==str[x][y]-1)
			{
				printf("L ");
				x=x;
				y=y-2;
			}
		}
	}
	return 0;
}