#include <bits/stdc++.h>
#define mset(a,b) memset(a,b,sizeof a)
#define mcpy(a,b) memcpy(a,b,sizeof b)
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define pii pair<int,int> 
#define lb(x) ((x)&(-(x)))
#define inf 0x3f3f3f3f
#define N 205
using namespace std;
typedef long long ll;
string T[6]={"UL","UR","R","LR","LL","L"};
int X[6]={-2,-2,0,2,2,0},Y[6]={-1,1,2,1,-1,-2};
int n,a,b,C,D,pre[N][N],d[N][N],q[N*N],l,r,tp;
bool vis[N][N];
string ans[N*N];
int main(){
	cin>>n>>a>>b>>C>>D;
	q[0]=C*1000+D;
	while(l<=r){
		int x=q[l]/1000,y=q[l]%1000;l++;
		vis[x][y]=1;
		for(int i=0;i<6;i++){
			int a=x+X[i],b=y+Y[i];
			if(a>=0&&a<n&&b>=0&&b<n&&!vis[a][b])q[++r]=a*1000+b,d[a][b]=d[x][y]+1,pre[a][b]=x*1000+y,vis[a][b]=1;
		}
	}
	if(!vis[a][b])return puts("Impossible"),0;
	printf("%d\n",d[a][b]);
	int t=d[a][b];
	while(t--){
		for(int i=0;i<6;i++){
			int x=a+X[i],y=b+Y[i];
			if(x>=0&&x<n&&y>=0&&y<n&&d[x][y]==d[a][b]-1){cout<<T[i]<<" ",a=x,b=y;break;}
		}
	}
	return 0;
}