#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<queue>
#include<string>
#include<map>
#include<cmath>
#include<bitset>
#include<set>
#include<cstring>
#include<cstdlib>
#include<complex>
#include<list>
#include<sstream>
#include<cassert>

using namespace std;

typedef pair<int,int> ii;
typedef vector<int> vi;
typedef pair<long long,long long> ll;
typedef pair<int,long long> il;
long long mod = 1000000007LL;
long long large = 2000000000000000000LL;



int n;

int ver[] = {-1,1,2,1,-1,-2};
int hor[] = {-2,-2,0,2,2,0};
string way[] = {"UL","UR","R","LR","LL","L"};

bool in(int x,int y){
	return x>=0&&x<n&&y>=0&&y<n;
}
int main(){


	cin>>n;

	int stx,sty,enx,eny;
	cin>>stx>>sty>>enx>>eny;
	vector<vector<int> > dp(n,vector<int>(n,1000000000));
	dp[enx][eny] = 0;
	queue<ii> q;
	q.push(ii(enx,eny));
	while(!q.empty()){
		int ux = q.front().first;
		int uy = q.front().second;
		q.pop();
		for(int j=0;j<6;j++){
			int vx = ux+hor[j];
			int vy = uy+ver[j];
			if(in(vx,vy)){
				if(dp[vx][vy]==1000000000){
					dp[vx][vy] = dp[ux][uy]+1;
					q.push(ii(vx,vy));
				}
			}
		}
	}
	if(dp[stx][sty]==1000000000){
		cout<<"Impossible"<<endl;
		return 0;
	}
	cout<<dp[stx][sty]<<endl;
	while(!(stx==enx&&sty==eny)){
		for(int j=0;j<6;j++){
			int vx = stx+hor[j];
			int vy = sty+ver[j];
			if(in(vx,vy)&&dp[vx][vy]==dp[stx][sty]-1){
				cout<<way[j]<<" ";
				stx = vx;
				sty = vy;
				break;
			}
		}
	}


	return 0;
}