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

vector<int> v[40001];
int vis[40001];
int par[40001];

inline int hsh(int n,int i,int j)
{
	return (n*i+j);
}
inline bool condition(int n,int i,int j)
{
	if(i>=0 && i<n && j>=0 && j<n)
		return true;
	else
		return false;
}
void bfs(int n,int ss,int tt)
{
	//cout<<ss<<" "<<tt<<endl;
	queue<int> q;
	q.push(ss);
	vis[ss]=1;
	while(!q.empty())
	{
		int p=q.front();
		q.pop();
		for(int i=0;i<v[p].size();i++)
		{
			if(vis[v[p][i]]==0)
			{
				vis[v[p][i]]=1;
				q.push(v[p][i]);
				par[v[p][i]]=p;
			}	
		}
	}
	//cout<<par[ss]<<" "<<par[tt]<<endl;
	if(vis[tt]==0)
		cout<<"Impossible"<<endl;
	else
	{
		vector<int> path;
		int cnt=0;
		int x=tt;
		path.push_back(x);
		while(par[x]!=-1)
		{
			cnt++;
			x=par[x];
			path.push_back(x);
		}
		cout<<cnt<<endl;
		for(int i=path.size()-1;i>0;i--)
		{
			//cout<<"<"<<path[i]/n<<","<<path[i]%n<<"> "<<endl;
			int r1=path[i]/n;
			int c1=path[i]%n;
			int r2=path[i-1]/n;
			int c2=path[i-1]%n;
			//cout<<path[i]<<" "<<path[i-1]<<endl;
			if(r2==r1 && c2==c1-2)
			{
				cout<<"L ";
			}	
			else if(r2==r1 && c2==c1+2)
			{
				cout<<"R ";
			}
			else if(r2==r1-2 && c2==c1-1)
			{
				cout<<"UL ";
			}	
			else if(r2==r1-2 && c2==c1+1)
			{
				cout<<"UR ";
			}	
			else if(r2==r1+2 && c2==c1-1)
			{
				cout<<"LL ";
			}	
			else if(r2==r1+2 && c2==c1+1)
			{
				cout<<"LR ";
			}	
		}
		cout<<endl;
	}
}
int main()
{
	int n;
	cin>>n;
	int s,t,i,j;
	cin>>s>>t>>i>>j;
	for(int i=0;i<n*n;i++)
	{
		int r=i/n;
		int c=i%n;
		if(condition(n,r-2,c-1))
			v[i].push_back(hsh(n,r-2,c-1));
		if(condition(n,r-2,c+1))
			v[i].push_back(hsh(n,r-2,c+1));
		if(condition(n,r,c+2))
			v[i].push_back(hsh(n,r,c+2));
		if(condition(n,r+2,c+1))
			v[i].push_back(hsh(n,r+2,c+1));
		if(condition(n,r+2,c-1))
			v[i].push_back(hsh(n,r+2,c-1));
		if(condition(n,r,c-2))
			v[i].push_back(hsh(n,r,c-2));		
	}	
	/*for(int i=0;i<n*n;i++)
	{
		cout<<"<"<<i/n<<","<<i%n<<"> "<<": ";
		for(int j=0;j<v[i].size();j++)
		{
			cout<<"<"<<v[i][j]/n<<","<<v[i][j]%n<<"> ";
		}
		cout<<endl;
	}*/
	for(int i=0;i<n*n;i++)
	{
		vis[i]=0;
		par[i]=-1;
	}
	bfs(n,hsh(n,s,t),hsh(n,i,j));
	return 0;
}