#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N=222;
int dis[N][N];
int dx[]={-2,-2, 0,+2,+2, 0};
int dy[]={-1,+1,+2,+1,-1,-2};
string kerim[]={"UL","UR","R","LR","LL","L"};
int n,x,y,xx,yy;
void rec(int nx,int ny,int jump){
	if(nx==xx and ny==yy){
		puts("");
		return;	
	}
	for(int i=0;i<6;i++){
		int tox=nx+dx[i];
		int toy=ny+dy[i];
		if(tox>=0 and toy>=0 and tox<n and toy<n and dis[tox][toy]==jump-1){
			cout<<kerim[i]<<" ";
			rec(tox,toy,jump-1);
			return;
		}
	}
}
int main(){
    //~ freopen("file.in", "r", stdin);
    scanf("%d",&n);
    for(int i=0;i<n;i++)	
		for(int j=0;j<n;j++)
			dis[i][j]=INF;
    scanf("%d%d%d%d",&x,&y,&xx,&yy);
    queue<PII>q;
    q.push(mp(xx,yy));
    dis[xx][yy]=0;
    while(!q.empty()){
		int nx=q.front().ff;
		int ny=q.front().ss;
		q.pop();
		for(int i=0;i<6;i++){
			int tox=nx+dx[i];
			int toy=ny+dy[i];
			if(tox>=0 and toy>=0 and tox<n and toy<n and umin(dis[tox][toy],dis[nx][ny]+1))
				q.push(mp(tox,toy));
		}
	}
	if(dis[x][y]==INF)
		return puts("Impossible")*0;
	printf("%d\n",dis[x][y]);
	rec(x,y,dis[x][y]);
	return 0;
}