// Nipun Poddar , CSE, MNNIT Allahabad
 
#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<queue>
#include<cmath>
#include<stack>
#include<cstring>
#include<algorithm>
#include<list>
 
#define in(n) scanf("%d",&n)
#define in2(n,m) scanf("%d%d",&n,&m)
#define in3(n,m,p) scanf("%d%d%d",&n,&m,&p)
#define inll(n) scanf("%lld",&n)
#define inll2(n,m) scanf("%lld%lld",&n,&m)
#define out(n) printf("%d\n",n)
#define out2(n,m) printf("%d %d\n",n,m)
#define outll(n) printf("%lld\n",n)
#define outll2(n,m) printf("%lld %lld\n",n,m)
#define inc(n) scanf("%c",&n)
#define minm(a,b) (a<b?a:b)
#define maxm(a,b) (a<b?b:a)
#define loop(n) for(i=0;i<n;i++)
#define loop1(n) for(i=1;i<=n;i++)
#define fill0(x) memset(x,0,sizeof(x))
#define fill1(x) memset(x,-1,sizeof(x))
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define pii pair<int,int>
#define ppi pair<int,pii>
 
#define REP(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, n) for(int i = a; i < n; i++)
#define REV(i, a, n) for(int i = a; i > n; i--)
#define FORALL(itr, c) for(itr = (c).begin(); itr != (c).end(); itr++)
#define ALL(A) A.begin(), A.end()
#define LLA(A) A.rbegin(), A.rend()
 
//int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
//int dx[] = {1, 1, 1, 0, 0, -1, -1, -1}, dy[] = {1, 0, -1, 1, -1, 1, 0, -1};
 
#define chkbit(s, b) (s & (1<<b))
#define setbit(s, b) (s |= (1<<b))
#define clrbit(s, b) (s &= ~(1<<b))
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int ui;
 
 
#define MOD 1000000007
#define MOD_INV 1000000006
#define MAX 100009
#define INF 999999999
 
inline int max2(int a, int b) {
	return ((a > b)? a : b);
}
 
inline int max3(int a, int b, int c) {
	return max2(a, max2(b, c));
}
 
long long gcd(long long a,long long b)
{
	while(b)
		b^=a^=b^=a%=b;
	return a;
}
long long int power(long long int b,long long int e)
{
	long long ans=1,temp;
	while(e>0)
	{
		if(e%2)
			ans=(ans*b)%MOD;
		b=(b*b)%MOD;
		e/=2;
	}
	return ans;
}
/*
inline int next_int() {
	int n = 0;
	char c = getchar_unlocked();
	while (!('0' <= c && c <= '9')) {
		c = getchar_unlocked();
	}
	while ('0' <= c && c <= '9') {
		n = n * 10 + c - '0';
		c = getchar_unlocked();
	}
	return n;
}*/
 
using namespace std;

int n,ux,uy,vx,vy;
int vis[205][205];
int level;
int dy[6]={-1,+1,+2,+1,-1,-2};
int dx[6]={-2,-2,0,+2,+2,0};
string moves[6]={"UL","UR","R","LR","LL","L"};
vector<string> mlist[205][205];

bool valid(int x,int y)
{
	if(x<0 || y<0 || x>=n || y>=n)
		return false;
	return true;
}
void bfs(int x,int y)
{
	if(vis[x][y])
		return;
	vis[x][y]=1;
	list<pii> que;
	que.PB(MP(x,y));
	while(!que.empty())
	{
		pii c=que.front();
		que.pop_front();
		x=c.F;y=c.S;
		level++;
		//cout<<"New Level: "<<level<<endl;
		//cout<<x<<" "<<y<<endl;
		if(x==vx && y==vy)
			break;
		for(int i=0;i<6;i++)
		{
			if(valid(x+dx[i],y+dy[i]))
			{
				if(!vis[x+dx[i]][y+dy[i]])
				{
					vis[x+dx[i]][y+dy[i]]=1;
					mlist[x+dx[i]][y+dy[i]]=mlist[x][y];
					mlist[x+dx[i]][y+dy[i]].PB(moves[i]);
					que.PB(MP(x+dx[i],y+dy[i]));
				}	
			}
		}
	}
}
int main()
{
	int t,i,j,m;
	in(n);
	in2(ux,uy);
	in2(vx,vy);
	level=-1;
	bfs(ux,uy);
	if(!vis[vx][vy])
		printf("Impossible\n");
	else
	{
		out(mlist[vx][vy].size());
		for(i=0;i<mlist[vx][vy].size();i++)
			printf("%s%c",mlist[vx][vy][i].c_str(),(((i+1)==mlist[vx][vy].size())?'\n':' '));
	}
	return 0;
}