#include <iostream>
#include<bits/stdc++.h>
#define	MIN(a,b,c)	min(min(a,b),c)
#define	MAX(a,b,c)	max(max(a,b),c)
#define ll          long long
#define itr         vector<ll>::iterator
#define pb          push_back
#define mp          make_pair
#define pii         pair<ll,ll>
#define vi          vector<ll>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define mem(a,b) memset(a,b,sizeof(a))
#define sz size()
#define hell        1000000007
#define endl        '\n'
#define rep(i,a,b) for(i=a;i<b;i++)
#define repr(i,a,b) for(i=a;i>=b;i--)
#define Vit std::vector<ll>:: iterator
#define Sit std::set<ll>:: iterator
#define Mit std::map<ll,ll>:: iterator
#define lb lower_bound
#define ub upper_bound
#define bs          binary_search
#define tr(container, it) for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
using namespace std;



int main()
{
	
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;cin>>n;
	vector <char> v;
	int a,b,c,d,x,y,ans=0;
	cin>>a>>b>>c>>d;
	char z;
	
	if((a-c)%2!=0)
	cout<<"Impossible";
	else if((abs(((a-c)/2))-abs(b-d))%2!=0)
	cout<<"Impossible";
	else
	{
		if(a>c&&b>=d)
		{
			y=a-c;x=b-d;
			if(y/2<x)
			{
				ans=y/2 + (x-y/2)/2;
			}
			else
			ans=y/2;
			
			cout<<ans<<endl;
			while(y>0&&x>0)
			{
				z='5';v.push_back(z);y-=2;x--;
			}
			if(x==0&&y!=0)
			{
				while(y>0)
				{
					z='6';v.push_back(z);y-=2;
					z='5';v.push_back(z);y-=2;
				}
			}
			if(y==0&&x!=0)
			{
				while(x>0)
				{
					z='1';v.push_back(z);x-=2;
				}
			}
			 sort(v);
			 for(int i=0;i<v.size();i++)
			 {
			 	if(v[i]=='1')
			 	cout<<"L ";
			 	if(v[i]=='2')
			 	cout<<"LL ";
			 	if(v[i]=='3')
			 	cout<<"LR ";
			 	if(v[i]=='4')
			 	cout<<"R ";
			 	if(v[i]=='5')
			 	cout<<"UR ";
			 	if(v[i]=='6')
			 	cout<<"UL ";
			 }
		}
		
		
		if(a>=c&&d>b)
		{
			y=a-c;x=d-b;
			if(y/2<x)
			{
				ans=y/2 + (x-y/2)/2;
			}
			else
			ans=y/2;
			cout<<ans<<endl;
			while(y>0&&x>0)
			{
				z='5';v.push_back(z);y-=2;x--;
			}
			if(x==0&&y!=0)
			{
				while(y>0)
				{
				z='6';	v.push_back(z);y-=2;
				z='5';	v.push_back(z);y-=2;
				}
			}
			if(y==0&&x!=0)
			{
				while(x>0)
				{
					z='4';v.push_back(z);x-=2;
				}
			}sort(v);
			 for(int i=0;i<v.size();i++)
			 {
			 	if(v[i]=='1')
			 	cout<<"L ";
			 	if(v[i]=='2')
			 	cout<<"LL ";
			 	if(v[i]=='3')
			 	cout<<"LR ";
			 	if(v[i]=='4')
			 	cout<<"R ";
			 	if(v[i]=='5')
			 	cout<<"UR ";
			 	if(v[i]=='6')
			 	cout<<"UL ";
			 }

		}
		
		
		
		
		if(a<=c&&d<b)
		{
			y=c-a;x=b-d;
			if(y/2<x)
			{
				ans=y/2 + (x-y/2)/2;
			}
			else
			ans=y/2;
			cout<<ans<<endl;
			while(y>0&&x>0)
			{
			z='2';	v.push_back(z);y-=2;x--;
			}
			if(x==0&&y!=0)
			{
				while(y>0)
				{
					z='2';v.push_back(z);y-=2;
					z='3';v.push_back(z);y-=2;
				}
			}
			if(y==0&&x!=0)
			{
				while(x>0)
				{
					z='4';v.push_back(z);x-=2;
				}
			}	 sort(v);
			  for(int i=v.size()-1;i>=0;i--)
{
			 	if(v[i]=='1')
			 	cout<<"L ";
			 	if(v[i]=='2')
			 	cout<<"LL ";
			 	if(v[i]=='3')
			 	cout<<"LR ";
			 	if(v[i]=='4')
			 	cout<<"R ";
			 	if(v[i]=='5')
			 	cout<<"UR ";
			 	if(v[i]=='6')
			 	cout<<"UL ";
			 }

		}
		
		if(a<c&&d>=b)
		{
			y=c-a;x=d-b;
			if(y/2<x)
			{
				ans=y/2 + (x-y/2)/2;
			}
			else
			ans=y/2;
			cout<<ans<<endl;
			while(y>0&&x>0)
			{
				z='3';v.push_back(z);y-=2;x--;
			}
			if(x==0&&y!=0)
			{
				while(y>0)
				{
					z='3';v.push_back(z);y-=2;
					z='2';v.push_back(z);y-=2;
				}
			}
			if(y==0&&x!=0)
			{
				while(x>0)
				{
					z='1';v.push_back(z);x-=2;
				}
			}	 sort(v);
			 for(int i=v.size()-1;i>=0;i--)
{
			 	if(v[i]=='1')
			 	cout<<"L ";
			 	if(v[i]=='2')
			 	cout<<"LL ";
			 	if(v[i]=='3')
			 	cout<<"LR ";
			 	if(v[i]=='4')
			 	cout<<"R ";
			 	if(v[i]=='5')
			 	cout<<"UR ";
			 	if(v[i]=='6')
			 	cout<<"UL ";
			 }

		}
		
		
	}


}