#include"bits/stdc++.h"


#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(int x = (l);x<=(u);x++)
#define RREP(x,l,u) for(int x = (l);x>=(u);x--)
#define mst(x,a) memset(x,a,sizeof(x))
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define se second
#define fi first
#define dbg(x) cout<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define cl(x) x.clear()

typedef  long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;

const int maxn = 210;
const int mod = 1e9+7;
const int MAX = 1000000010;
const double eps = 1e-6;
const double PI = acos(-1);

template<typename T> inline void read(T &x){
x=0;T f=1;char ch;do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}

template<typename A,typename B> inline void read(A&x,B&y){read(x);read(y);}
template<typename A,typename B,typename C> inline void read(A&x,B&y,C&z){read(x);read(y);read(z);}
template<typename A,typename B,typename C,typename D> inline void read(A&x,B&y,C&z,D&w){read(x);read(y);read(z);read(w);}
template<typename A,typename B> inline A fexp(A x,B p){A ans=1;for(;p;p>>=1,x=1LL*x*x%mod)if(p&1)ans=1LL*ans*x%mod;return ans;}
template<typename A,typename B> inline A fexp(A x,B p,A mo){A ans=1;for(;p;p>>=1,x=1LL*x*x%mo)if(p&1)ans=1LL*ans*x%mo;return ans;}

int n;

int sx,sy,tx,ty;

int d[maxn][maxn];

int dx[]={-2,-2,0,2,2,0};
int dy[]={-1,1,2,1,-1,-2};

vector<int> Ans;

queue<PII> Q;

void Work(){
	REP(i,1,n)REP(j,1,n)d[i][j]=MAX;
	d[tx][ty]=0;
	Q.push(MP(tx,ty));
	while(!Q.empty()){
		int x=Q.front().fi,y=Q.front().se;Q.pop();
		for(int i=0;i<6;i++){
			int tx=x+dx[i],ty=y+dy[i];
			if(tx<1||ty<1||tx>n||ty>n)continue;
			if(d[x][y]+1<d[tx][ty]){
				d[tx][ty]=d[x][y]+1;
				Q.push(MP(tx,ty));
			}
		}
	}
	if(d[sx][sy]==MAX){
		puts("Impossible");
	}
	else{
		printf("%d\n",d[sx][sy]);
		int x=sx,y=sy;
		while(x!=tx||y!=ty){
			REP(i,0,5){
				int tx=x+dx[i],ty=y+dy[i];
				if(tx<1||ty<1||tx>n||ty>n)continue;
				if(d[tx][ty]+1!=d[x][y])continue;
				if(i==0)printf("UL ");
				else if(i==1)printf("UR ");
				else if(i==2)printf("R ");
				else if(i==3)printf("LR ");
				else if(i==4)printf("LL ");
				else if(i==5)printf("L ");
				x=tx,y=ty;
				break;
			}
		}
		puts("");
	}
}

void Init(){
	read(n);
	read(sx,sy);sx++;sy++;
	read(tx,ty);tx++;ty++;
}

int main(){
	Init();
	Work();
	return 0;
}