#include<iostream>
#include<string>
#include<stack>
#include<map>
#include<stdio.h>
#include<iostream>
#include<string>
#include<stack>
#include<map>
#include<stdio.h>
#include<queue>
#include<vector>
#include<algorithm>
#include<memory.h>
#include<set>
#include<cmath>
#include<math.h>
#include<iomanip>
using namespace std; 

int const N=2e5+5;
vector< int  >v;
int x,z,n,m,co=0;
pair<int , int> par[300][300];
int x1,x2,y2;
bool vis[300][300];
int dx[]={-2 , -2 , 0 , 2 ,2 ,0 };
int dy[]={ -1 , 1 , 2 ,1 ,-1 , -2 };
string dr[]={"UL","UR","R","LR","LL","L"};
queue < pair <int ,int > >q;

int BFS(int a,int b ,int c,int d)
{ int cost=0;
	q.push(make_pair(a,b));
	vis[a][b]=true;
	par[a][b].first=-1;
	par[a][b].second=-1;
	while(!q.empty())
	{
		
	int u,w;
	u=q.front().first;
	w=q.front().second;
	//cout<<u<<" "<<w<<par[u][w].first<<" "<<par[u][w].second << endl;
	q.pop();
	if(u==c && w==d)
		return cost;
	
		for(int i=0;i<6;i++)
		{
			int aa,bb;
			aa=u+dx[i];
			bb=w+dy[i];

			if(vis[aa][bb] || aa<0 || aa>=n || bb<0 || bb>=n )
				continue;
			par[aa][bb].first=u;
			par[aa][bb].second=w;
			q.push(make_pair(aa,bb));
			vis[aa][bb]=true;
		}
		cost++;

	}
	return 1e9; 
}
int main()
{

	cin>>n;
	int y1;
	cin>>x1>>y1>>x2>>y2;
	int a=BFS(x1,y1,x2,y2);
	if(a==1e9)
		cout<<"Impossible"<<endl;
	else
	{
		int xx,yy;
		xx=par[x2][y2].first;
		yy=par[x2][y2].second;
	while(xx!=-1 && yy!=-1)
	{
	int dfx,dfy;
	dfx=xx-x2;
	dfy=yy-y2;
	
	//cout<<xx<<" "<<yy<<" "<<x2<<" "<<y2<<" "<<dfx<<""<<dfy<<endl;
	for(int i=0;i<6;i++)
		{
			if(-dfx==dx[i] && -dfy==dy[i])
			//if(xx+dx[i]==x2 && yy+dy[i]==y2)
			v.push_back(i);
		}
	x2=xx;
	y2=yy;
		xx=par[x2][y2].first;
		yy=par[x2][y2].second;
	}
	cout<<v.size()<<endl;
	for(int i=v.size()-1;i>=0 ;i--)
		{
			cout<<dr[v[i]]<<" ";
		}
	cout<<endl;
	}

  return 0;
}