#include<bits/stdc++.h>
#define pii pair<int, int>
using namespace std;

int x1[6]={-1, 1, 2, 1, -1, -2};
int y2[6]={-2, -2, 0, 2, 2, 0};
string way[6]={"UL", "UR", "R", "LR", "LL", "L"};//UL, UR, R, LR, LL, L
int n, sx, sy, ex, ey;
string outbt="";
queue<pair<pii, string> >  pos;
bool visit[205][205];
bool valid(int x, int y)
{
	if(x>=0 && y>=0 && x<n && y<n)
	{
		return 1;
	}
	return 0;
}
int bfs()
{
	pos.push(pair<pii, string> (pii(sx, sy), ""));
	visit[sx][sy]=1;
	int moves=0;
	while(!pos.empty())
	{
		moves++;
		int p=pos.size();
		for(int x=0;x<p;x++)
		{
			int nowx=pos.front().first.first;
			int nowy=pos.front().first.second;
			string nowbt=pos.front().second;
			pos.pop();
			for(int z=0;z<6;z++)
			{
				int newx=nowx+x1[z];
				int newy=nowy+y2[z];
				string newbt=nowbt;
				if(valid(newx, newy) && !visit[newx][newy])
				{
					visit[newx][newy]=1;
					newbt+=way[z];
					if(newx==ex && newy==ey)
					{
						outbt=newbt;
						return moves;
					}
					newbt+=" ";
					pos.push(pair<pii, string> (pii(newx, newy), newbt));
				}
			}
		}
	}
	return -1;
}

int main()
{
	cin>>n;
	cin>>sy>>sx>>ey>>ex;
	int h=bfs();
	if(h==-1)
	{
		cout<<"Impossible";
	}
	else
	{
		cout<<h<<endl<<outbt;
	}
	cout<<endl;
 	return 0;
}