//red knight's shortest path world code sprll hackerrank
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define PII pair<ll, ll>
#define mp make_pair(make_pair(ll(-1),ll(-1)),ll(-1))

ll n;
ll dy[] = {-1,1,2,1,-1,-2};
ll dx[] = {-2,-2,0,2,2,0};
bool visited[202][202]={0};
ll level[202][202]={0};
pair<PII, ll> parent[202][202];


bool bfs(PII p1, PII p2)
{
	visited[p1.first][p1.second]=true;
	queue<PII> q;
	q.push(p1);
	PII p;
	while(!q.empty())
	{
		PII p;
		p=q.front();
		q.pop();
		for(ll i=0;i<6;i++)
		{
			ll x,y;
			x=p.first+dx[i];
			y=p.second+dy[i];
			
			//cout<<x<<","<<y<<"!"<<endl;

			if(x>=0&&x<n&&y>=0&&y<n&&!visited[x][y])
			{
			    //cout<<x<<","<<y<<"!"<<endl;
				visited[x][y]=true;
				q.push(make_pair(x,y));
				parent[x][y]=make_pair(p,i);
				level[x][y]=level[p.first][p.second]+1;
				if(make_pair(x,y)==p2) return true;
			}
		}
	}
	return false;
}

void printAnswer(ll x, ll y)
{
	if(parent[x][y]==mp) return;
	else
	{
		printAnswer(parent[x][y].first.first,parent[x][y].first.second);
		ll k=parent[x][y].second;
		if(k==0) cout<<"UL"<<" ";
		if(k==1) cout<<"UR"<<" ";
		if(k==2) cout<<"R"<<" ";
		if(k==3) cout<<"LR"<<" ";
		if(k==4) cout<<"LL"<<" ";
		if(k==5) cout<<"L"<<" ";
	}
}

int main()
{
	cin>>n;
	ll istart,jstart,iend,jend;
	cin>>istart>>jstart>>iend>>jend;
	for(ll i=0;i<202;i++)
	{
		for(ll j=0;j<202;j++)
		{
			visited[i][j]=0;
			level[i][j]=0;
			parent[i][j]=mp;
		}
	}
	if(bfs(make_pair(istart,jstart),make_pair(iend,jend))==true)
	{
		cout<<level[iend][jend]<<endl;
		printAnswer(iend,jend);
	}
	else cout<<"Impossible"<<endl;
	return 0;
}