#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
using namespace std;

#define fir first
#define sec second

typedef long long LL;
typedef pair<int,int> PP;

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

int N;
int Stx,Sty;
int Edx,Edy;
bool vis[Maxn][Maxn];
int Ansn,Ans[Maxn*Maxn];
PP q[Maxn*Maxn]; int ql,qr;
int fa[Maxn][Maxn];

bool Judge(int x,int y){
	return (x>=0 && x<N && y>=0 && y<N);
}

void Print(int x){
	switch(x){
		case 0:printf("UL ");return ;
		case 1:printf("UR ");return ;
		case 2:printf("R ");return ;
		case 3:printf("LR ");return ;
		case 4:printf("LL ");return ;
		case 5:printf("L ");return ;
	}
}

void Bfs(){
	memset(vis,false,sizeof(vis));
	ql=qr=1; q[qr++]=PP(Stx,Sty);
	vis[Stx][Sty]=true,fa[Stx][Sty]=-1;
	while(ql<qr){
		int x=q[ql].fir,y=q[ql].sec; ++ql;
		for(int k=0;k<6;++k){
			int xx=x+dx[k],yy=y+dy[k];
			if(!Judge(xx,yy) || vis[xx][yy]) continue;
			fa[xx][yy]=k,vis[xx][yy]=true,q[qr++]=PP(xx,yy);
		}
	}
   if(!vis[Edx][Edy]){puts("Impossible");exit(0);}
	int x=Edx,y=Edy,k;
	while(fa[x][y]!=-1)
		k=fa[x][y],Ans[++Ansn]=k,x-=dx[k],y-=dy[k];
}

int main(){
	scanf("%d",&N);
	scanf("%d %d %d %d",&Stx,&Sty,&Edx,&Edy);
	Bfs();
	printf("%d\n",Ansn);
	for(int i=Ansn;i>=1;--i) Print(Ans[i]);
	return 0;
}