#include<bits/stdc++.h>
using namespace std;
int arr[500];

int main()
{
	char S[7][5]={"UL","UR","R","LR","LL","L"};
	long long int k=0,N,xi,xf,yi,yf;
	cin>>N;
	cin>>xi>>yi>>xf>>yf;
	
	swap(xi,yi);
	swap(xf,yf);
	
	if(abs(yi-yf)%2!=0)
	{
		cout<<"Impossible";
	}
	
	else
	{
		while((xi!=xf || yi!=yf) && xi<N && xi>=0 && yi<N && yi>=0)
		{
			if(yi==yf)
			{
				if(xi>xf)
				{
					arr[k++] = 5;
					xi=xf;
					break;
				}
				
				else
				{
					arr[k++] = 2;
					xi=xf;
					break;
				}
			}
			
			else if(yf<yi && xi<xf && xi+1<N && xi>=0 && yi<N && yi-2>=0)
			{
				arr[k++] = 1;
				yi-=2;
				xi+=1;
			}
			
			else if(yf<yi && xi>=xf && xi<N && xi-1>=0 && yi<N && yi-2>=0)
			{
				arr[k++] = 0;
				yi-=2;
				xi-=1;
			}
			
			else if(yf>yi && xi<xf && xi+1<N && xi>=0 && yi+2<N && yi>=0)
			{
				arr[k++] = 3;
				yi+=2;
				xi+=1;
			}
			
			else if(yf>yi && xi>=xf && xi<N && xi-1>=0 && yi+2<N && yi>=0)
			{
				arr[k++] = 4;
				yi+=2;
				xi-=1;
			}
			
			//cout<<xi<<" "<<yi<<endl;
		}
		
		sort(arr,arr+k);
		cout<<k<<endl;
		for(int i=0;i<k;i++)
		{
			cout<<S[arr[i]]<<" ";
		}
	}
}