#include<bits/stdc++.h>
using namespace std;
int xmoves[] = { -2 , -2 , 0 , 2 ,  2 ,  0 };
int ymoves[] = {-1,1,2,1,-1,-2} ;
struct cell
{
	int x,y;
	int dis;
	vector< pair <int,int> > path;
};
bool isValid(int x, int y, int N)
{
	if(x>=0 && x<N && y>=0 && y<N)
		return true;
	return false;
}
void print(vector< pair <int,int> > &path)
{
	map<int,string>m;
	m[-3]="UL", m[-1] = "UR", m[2]="R", m[3]="LR", m[1] = "LL", m[-2] = "L";
	/*for(int i = 0 ;i<path.size();i++)
	{
		cout<<path[i].first<<" "<<path[i].second<<endl;
	}*/
	for(int i=1;i<path.size();i++)
	{
		cout<<m[(path[i].first-path[i-1].first)+(path[i].second-path[i-1].second)]<<" ";
	}
	cout<<endl;
}


void find_path(int knightPos[],int targetPos[], int N)
{
	
	vector< pair <int,int> > path;

	path.push_back(make_pair(knightPos[0],knightPos[1]));

	bool visited[N][N];
	for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++)
            visited[i][j] = false;
	cell t,c;
	int x,y,dis;
			
			t.x = knightPos[0];
			t.y = knightPos[1];
			t.dis = 0;
			t.path = path;

	queue<cell>q;
	q.push(t);
	while(!q.empty())
	{
		t = q.front();
			q.pop();
		path = t.path;
		
		visited[t.x][t.y] = true;
		if(t.x == targetPos[0] && t.y == targetPos[1])
		{
			
			cout<<t.dis<<endl;
			print(path);
			return;
		}
		for(int i=0;i<6;i++)
		{
			x = t.x+xmoves[i];
			y = t.y+ymoves[i];
			path = t.path;
			if(isValid(x,y,N)&&!visited[x][y])
			{
				
				c.x = x;
				c.y = y;
				c.dis = t.dis+1;
				path.push_back(make_pair(x,y));
				c.path = path;
				q.push(c);
			}
			
		}
	}

	cout<<"Impossible"<<endl;
}
int main()
{
	int n,a,b,c,d;
	cin>>n>>a>>b>>c>>d;
	int knightPos[] = {a,b};
	int targetPos[] = {c,d};
	find_path(knightPos,targetPos,n);
	return 0;
}