#include"bits/stdc++.h"
#define F(i,j,n) for(register int i=j;i<=n;i++)
#define D(i,j,n) for(register int i=j;i>=n;i--)
#define ll long long
#define N 210
using namespace std;
namespace io{
	const int L=(1<<19)+1;
	char ibuf[L],*iS,*iT,c;int f;
	char gc(){
		if(iS==iT){
			iT=(iS=ibuf)+fread(ibuf,1,L,stdin);
			return iS==iT?EOF:*iS++;
		}
		return*iS++;
	}
	template<class I>void gi(I&x){
		for(f=1,c=gc();c<'0'||c>'9';c=gc())if(c=='-')f=-1;
		for(x=0;c<='9'&&c>='0';c=gc())x=x*10+(c&15);x*=f;
	}
};
using io::gi;
using io::gc;
int n,f[N][N],sx,sy,x,y,inf=1<<20,p[N*N],q[N*N],l,r;
int main()
{
	gi(n);
	gi(sx);gi(sy);gi(x);gi(y);
	sx++;sy++;x++;y++;
	F(i,1,n)F(j,1,n)f[i][j]=inf;
	f[x][y]=0;
	r++;p[r]=x;q[r]=y;
	while(l<r&&f[sx][sy]==inf){
		l++;x=p[l];y=q[l];
//		printf("%d %d %d\n",x,y,f[x][y]);
		if(x>2&&y>1&&f[x-2][y-1]==inf){
			r++;p[r]=x-2;q[r]=y-1;
			f[x-2][y-1]=f[x][y]+1;
		}
		if(x>2&&y<n&&f[x-2][y+1]==inf){
			r++;p[r]=x-2;q[r]=y+1;
			f[x-2][y+1]=f[x][y]+1;
		}
		if(x<n-1&&y>1&&f[x+2][y-1]==inf){
			r++;p[r]=x+2;q[r]=y-1;
			f[x+2][y-1]=f[x][y]+1;
		}
		if(x<n-1&&y<n&&f[x+2][y+1]==inf){
			r++;p[r]=x+2;q[r]=y+1;
			f[x+2][y+1]=f[x][y]+1;
		}
		if(y<n-1&&f[x][y+2]==inf){
			r++;p[r]=x;q[r]=y+2;
			f[x][y+2]=f[x][y]+1;
		}
		if(y>2&&f[x][y-2]==inf){
			r++;p[r]=x;q[r]=y-2;
			f[x][y-2]=f[x][y]+1;
		}
	}
	if(f[sx][sy]==inf){puts("Impossible");return 0;}
	printf("%d\n",f[sx][sy]);
	x=sx;y=sy;
	F(i,1,f[sx][sy]){
		if(x>2&&y>1&&f[x][y]-1==f[x-2][y-1]){
			printf("UL ");x-=2;y--;continue;
		}
		if(x>2&&y<n&&f[x][y]-1==f[x-2][y+1]){
			printf("UR ");x-=2;y++;continue;
		}
		if(y<n-1&&f[x][y]-1==f[x][y+2]){
			printf("R ");y+=2;continue;
		}
		if(x<n-1&&y<n&&f[x][y]-1==f[x+2][y+1]){
			printf("LR ");x+=2;y++;continue;
		}
		if(x<n-1&&y>1&&f[x][y]-1==f[x+2][y-1]){
			printf("LL ");x+=2;y--;continue;
		}
		if(y>2&&f[x][y]-1==f[x][y-2]){
			printf("L ");y-=2;continue;
		}
	}
	return 0;
}