#include "bits/stdc++.h"
using namespace std;

#define N 205
#define inf 100000

int n;
int a[N][N];
string p[N][N];
queue<pair<int,int> > b;

bool ok(int x,int y,int u,int v){
	return ((!(x<0 || y<0 || x>=n || y>=n)) && a[x][y]>(a[u][v]+1));
}

int main(){
    for(int i=0;i<N;i++) for(int j=0;j<N;j++) a[i][j]=inf;

    cin>>n;
	int x,y,dx,dy,px,py;
	cin>>x>>y>>dx>>dy;

	a[y][x]=0;
	p[y][x]="NO";

	b.push({y,x});
	while(!b.empty()){
		px=b.front().first;py=b.front().second;b.pop();
		//cout<<px<<" "<<py<<"\n";
		if(ok(px-1,py-2,px,py)) a[px-1][py-2]=a[px][py]+1,b.push({px-1,py-2}),p[px-1][py-2]="UL";
		if(ok(px+1,py-2,px,py)) a[px+1][py-2]=a[px][py]+1,b.push({px+1,py-2}),p[px+1][py-2]="UR";
		if(ok(px+2,py,px,py)) a[px+2][py]=a[px][py]+1,b.push({px+2,py}),p[px+2][py]="R";
		if(ok(px+1,py+2,px,py)) a[px+1][py+2]=a[px][py]+1,b.push({px+1,py+2}),p[px+1][py+2]="LR";
		if(ok(px-1,py+2,px,py)) a[px-1][py+2]=a[px][py]+1,b.push({px-1,py+2}),p[px-1][py+2]="LL";
		if(ok(px-2,py,px,py)) a[px-2][py]=a[px][py]+1,b.push({px-2,py}),p[px-2][py]="L";
	}

    if(a[dy][dx]>=inf){
        cout<<"Impossible";
        return 0;
    }
	cout<<a[dy][dx]<<"\n";
	
	vector<string> print;
	px=dy,py=dx;
	while(p[px][py]!="NO"){
		print.push_back(p[px][py]);
		if(p[px][py]=="UL") px++,py+=2;
		else if(p[px][py]=="UR") px--,py+=2;
		else if(p[px][py]=="R") px-=2;
		else if(p[px][py]=="LR") px--,py-=2;
		else if(p[px][py]=="LL") px++,py-=2;
		else px+=2;
	}

	for(auto it=print.rbegin();it!=print.rend();++it) cout<<*it<<" ";
	return 0;
}