#include<iostream>
using namespace std;
int mod(int a)
{
if(a<=0)
return(-a);
else
return(a);
}
void printShortestPath(int n,int i_start,int j_start,int i_end,int j_end)
{
int a=i_end-i_start;
int b=j_end-j_start;
int i,check;
if(i_start>=n)
	cout<<"Impossible";
else if(i_end>=n)
	cout<<"Impossible";
	else if(j_start>=n)
	cout<<"Impossible";
	else if(j_end>=n)
	cout<<"Impossible";
	else if(i_start<0)
	cout<<"Impossible";
else if(i_end<0)
	cout<<"Impossible";
	else if(j_start<0)
	cout<<"Impossible";
	else if(j_end<0)
	cout<<"Impossible";
else if(mod(a)%2==1)
	cout<<"Impossible";
else if(b==0)
	{
	if(mod(a)%4!=0)
				cout<<"Impossible";
	else
	{
				if(a<0)
				{
					check=-a/2;
					cout<<check<<endl;
					for(i=0;i<check;i=i+2)
					cout<<"UL UR ";
				}	
				else
				{
					check=a/2;
					cout<<check<<endl;
					for(i=0;i<check;i=i+2)
					cout<<"LR LL ";
				}		
	}				
	}
	else if(a==0)
	{
			if(mod(b)%2==1)
			cout<<"Impossible";
			else
			{
					if(b>0)
					{
						check=b/2;
						cout<<check<<endl;
						for(i=0;i<check;i++)
						cout<<"R ";
					}	
					else
					{
						check=-b/2;
						cout<<check<<endl;
						for(i=0;i<check;i++)
						cout<<"L ";
					}	
			}			
	}					
	else
	{
			if((mod((a/2))%2==1)&&(mod(b)%2==0))
					cout<<"Impossible";
			else if((mod((a/2))%2==0)&&(mod(b)%2==1))
					cout<<"Impossible";
			else
			{
					if(a<0&&b<0)
					{
						check=-a/2;
						cout<<(check-(b+check)/2)<<endl;
						for(i=0;i<check;i++)
						{
							cout<<"UL ";
							b=b+1;
						}	
						b=-b;
						for(i=0;i<b;i=i+2)
						cout<<"L ";
					}	
					else if(a<0&&b>0)
					{
						check=-a/2;
						cout<<(check+(b-check)/2)<<endl;
						for(i=0;i<check;i++)
						{
							cout<<"UR ";
							b=b-1;
						}	
						for(i=0;i<b;i=i+2)
						cout<<"R ";
					}
					else if(a>0&&b>0)
					{
						int j;
						check=a/2;
						cout<<(check+(b-check)/2)<<endl;
						for(i=0;i<check;i++)
							b=b-1;	
						for(j=0;j<b;j=j+2)
						cout<<"R ";
						while(i!=0)
							{
								cout<<"LR ";
								i--;
							}
					}
					else
					{
						check=a/2;
						cout<<(check-(b+check)/2)<<endl;
						for(i=0;i<check;i++)
						{
							cout<<"LL ";
							b=b+1;
						}	
						b=-b;
						for(i=0;i<b;i=i+2)
						cout<<"L ";
					}	
					}		
	}					
}	
int main()
{
int n;
cin>>n;
int i_start,j_start,i_end,j_end;
cin>>i_start>>j_start>>i_end>>j_end;
printShortestPath(n,i_start,j_start,i_end,j_end);
return 0;
}