#include<iostream>
#include<queue>
#include<cmath>
using namespace std;
queue<string> q;
void solve(int x1,int y1,int x2,int y2,int *flag)
{
	//cout<<x1<<" "<<y1<<endl;
	if((*flag)==0)
	return;
	if(x1==x2)
	{
		if(y1==y2 && (*flag)==1)
		{
			cout<<q.size()<<endl;
	        while(!q.empty())
	        {
		        cout<<q.front()<<" ";
		        q.pop();
	        }
	        return;
		}
		else
		{
			if(abs(y1-y2)%2==0)
			{
				int t=abs(y1-y2)/2;
				if(y2>y1)
				{
					while(t--)
					{
						q.push("R");
					}
				}
				else
				{
					while(t--)
					{
						q.push("L");
					}
				}
				y1=y2;
				solve(x1,y1,x2,y2,flag);
			}
			else
			{
				cout<<"Impossible";
				(*flag)=0;
				return;
			}
		}
	}
	else if(y1==y2)
	{
		if(abs(x1-x2)==1 || abs(x1-x2)==2)
		{
			cout<<"Impossible";
			(*flag)=0;
			return;
		}
		if(x1>x2)
		{
			q.push("UL");
			solve(x1-2,y1+1,x2,y2,flag);
		}
		else
		{
			q.push("LL");
			solve(x1+2,y1-1,x2,y2,flag);
		}
	}
	else if(x2<x1 && y2<y1)
	{
		y1=y1-1;
		x1=x1-2;
		q.push("UL");
		solve(x1,y1,x2,y2,flag);
	}
	else if(x2<x1 && y2>y1)
	{
		y1=y1+1;
		x1=x1-2;
		q.push("UR");
		solve(x1,y1,x2,y2,flag);
	}
	else if(x2>x1 && y2<y1)
	{
		y1=y1-1;
		x1=x1+2;
		q.push("LL");
		solve(x1,y1,x2,y2,flag);
	}
	else if(x2>x1 && y2>y1)
	{
		y1=y1+1;
		x1=x1+2;
		q.push("LR");
		solve(x1,y1,x2,y2,flag);
	}
}
int main()
{
	int i,j,k,t,n,l,x1,y1,x2,y2,flag=1;
	cin>>n;
	cin>>x1>>y1>>x2>>y2;
	solve(x1,y1,x2,y2,&flag);
	return 0;
}