#include<map>
#include<iomanip>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<cstring>
#include<string>
#include<math.h>
#include<sstream>
#include<cctype>
#include<set>
#include<queue>
#include<stack>
#include<ctime>
#include<cstdlib>
#include<cassert>
#include<utility>
#include<complex>
#include<bitset>
#include<complex>
#include<fstream>
#include<list>
using namespace std;
#define L long
#define LL long long
//#define double long double
#define LD long double
#define f first
#define s second
//#define x first
//#define y second
//#define G getchar_unlocked
#define mp make_pair
#define pb push_back
//#define pb(a,b) push_back(make_pair(a,b))
#define INF (20000000000000000LL)
#define MOD 1000000007
#define Endl endl
#define PI 3.141592653589793238
inline LL max(LL a,LL b){return (a>b)?a:b;}
inline int min(int a,int b){return (a<b)?a:b;}
LL gcd(LL a,LL b){return (b)?gcd(b,a%b):a;}
inline LL ab(LL a){return (a>0)?a:-a;}
LL lcm(LL a,LL b){return (a*b)/gcd(a,b);}
LL modpow(LL n,LL k,LL mod)
{LL ans=1;while(k>0){if(k&1)ans=(ans*n)%mod;k>>=1;n=(n*n)%mod;}return ans;}
LL poww(LL n ,LL k)
{LL ans=1;while(k>0){if(k&1)ans=(ans*n);k>>=1;n=(n*n);}return ans;}
//double min(double a,double b){return (a<b)?a:b;}
//double max(double a,double b){return (a>b)?a:b;}
//double ab(double x){return (x>=0.0)?x:-x;}
int myrandom(int i){return rand()%i;}


string output[]={"UL","UR","R","LR","LL","L"};

LL dy[]={-1,1,2,1,-1,-2};
LL dx[]={-2,-2,0,2,2,0};
LL Vis[205][205]={};
string DP[205][205];
queue<pair<LL,LL> >Q;
LL n;

bool valid(LL x,LL y)
{
	if(x>=0 && x<n)
	if(y>=0 && y<n)
		return 1;
	return 0;
}


int main()
{
	ios::sync_with_stdio(false);
	LL ist,jst,ien,jen,xx,yy,i;
	pair<LL,LL>p;
	cin>>n;
	cin>>ist>>jst>>ien>>jen;
	DP[ist][jst]="";
	Vis[ist][jst]=1;
	Q.push(mp(ist,jst));
	while(!Vis[ien][jen] && !Q.empty())
	{
		p=Q.front();
		//cout<<p.f<<" "<<p.s<<endl;
		Q.pop();
		for(i=0;i<6;i++)
		{
			xx=p.f+dx[i];
			yy=p.s+dy[i];
			if(valid(xx,yy) && Vis[xx][yy]==0)
			{
				Vis[xx][yy]=Vis[p.f][p.s]+1;
				DP[xx][yy]=DP[p.f][p.s]+output[i]+" ";
				Q.push(mp(xx,yy));
			}
		}
	}
	if(Vis[ien][jen])
		cout<<Vis[ien][jen]-1<<endl<<DP[ien][jen]<<endl;
	else
		cout<<"Impossible"<<endl;
	return 0;
}