#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;

struct node
{
	node(){}
	node(int x,int y):x(x),y(y){}
	int x,y;
};
node parent[200][200];
int a[6] = {-2,-2,0,+2,+2,0};
int b[6] = {-1,+1,+2,+1,-1,-2};
string ss[6] = {"UL","UR","R","LR","LL","L"};
bool vis[205][205];
int n,p,q,r,s;
void bfs()
{
	queue<node> qq;
	qq.push(node(p,q));
	vis[p][q]=1;
	while(!qq.empty())
	{
		node top = qq.front();
		//cout<<top.x<<" "<<top.y<<endl;
		qq.pop();
		for(int i=0;i<6;i++)
		{
			if(top.x+a[i]>=0 && top.x+a[i]<n && top.y+b[i]>=0 && top.y+b[i]<n)
			{
				if(!vis[top.x+a[i]][top.y+b[i]])
				{
					vis[top.x+a[i]][top.y+b[i]]=1;
					parent[top.x+a[i]][top.y+b[i]]=top;
					qq.push(node(top.x+a[i],top.y+b[i]));
				}
			}
		}
	}
}
vector<string> v;
int main()
{
	//freopen("inputf.txt","r",stdin);
	scanf("%d",&n);
	scanf("%d %d %d %d",&p,&q,&r,&s);
	bfs();
	if(!vis[r][s])
		printf("Impossible");
	else
	{
		while(r!=p || s!=q)
		{
			node pp = parent[r][s];
			for(int i=0;i<6;i++)
			{
				if(pp.x+a[i]==r && pp.y+b[i]==s)
					{v.emplace_back(ss[i]);break;}
			}
			r=pp.x,s=pp.y;
		}
		printf("%d\n",v.size());
		reverse(v.begin(),v.end());
		for(string st:v)
			cout<<st<<" ";
	}
	return 0;
}