#include <iostream>
#include <fstream>
#include <iomanip>
#include <math.h>
#include <limits.h>
#include <algorithm>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <string>
#include <string.h>
#include <sstream>
#include <ctime>

using namespace std;

#define eps 1e-12
#define pi 3.14159265358979323846
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define bgn begin
#define ll long long
#define ld long double
#define ull unsigned long long
#define ii pair<ll,ll>





const int N=210;
int n,r,r2,r3,c,c2,c3,res,d[N][N];
vector<pair<pair<int,int>,string>>mv;
queue<pair<int,int>>q;





void bfs(int r,int c)
{
	int r2,c2,r3,c3;
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)d[i][j]=-1;
	d[r][c]=0;
	q.push(mp(r,c));
	while(!q.empty())
	{
		r2=q.front().st;
		c2=q.front().nd;
		q.pop();
		for(auto p:mv)
		{
			r3=r2+p.st.st;
			c3=c2+p.st.nd;
			if(r3>=0&&r3<n&&c3>=0&&c3<n&&d[r3][c3]==-1)
			{
				d[r3][c3]=d[r2][c2]+1;
				q.push(mp(r3,c3));
			}
		}
	}
}






void solve()
{
	mv={{{-2,-1},"UL"},{{-2,1},"UR"},{{0,2},"R"},{{2,1},"LR"},{{2,-1},"LL"},{{0,-2},"L"}};
	cin>>n>>r>>c>>r2>>c2;
	bfs(r2,c2);
	if(d[r][c]==-1)cout<<"Impossible\n";
	else
	{
		res=d[r][c];
		cout<<res<<"\n";
		for(int i=1;i<=res;i++)
		{
			for(auto p:mv)
			{
				r3=r+p.st.st;
				c3=c+p.st.nd;
				if(r3>=0&&r3<n&&c3>=0&&c3<n&&d[r3][c3]!=-1&&d[r3][c3]+1==d[r][c])
				{
					cout<<p.nd<<" ";
					r=r3;
					c=c3;
					break;
				}
			}
		}
		cout<<"\n";
	}
}

int main()
{
	std::ios::sync_with_stdio(0);
	cin.tie(0);
#ifdef localProject
	freopen("in.txt","r",stdin);
#endif
	solve();
	return 0;
}