#include <bits/stdc++.h>
using namespace std;



int col[] = { 2, 2, -2, -2, 0, 0 };
int row[] = { -1, 1, 1, -1, 2, -2 };


bool valid(int x, int y,int N)
{
	if (x < 0 || y < 0 || x >= N || y >= N)
		return false;

	return true;
}


struct Node
{

	int x, y, dist;


	bool const operator==(const Node& o) const
	{
		return x == o.x && y == o.y;
	}

	bool operator<(const Node& o) const
	{
		return x < o.x || (x == o.x && y < o.y);
	}
};


void BFS(Node src, Node dest,int N)
{
    vector<string> list;

	map<Node, bool> visited;

	queue<Node> q;
	q.push(src);


	while (!q.empty())
	{

		Node node = q.front();
		q.pop();

		int x = node.x;
		int y = node.y;
		int dist = node.dist;


		if (x == dest.x && y == dest.y)
            {  for(int j=0;j<list.size();j++)
        cout<<list[j]<<" ";
               cout<<dist;}


		if (!visited.count(node))
		{

			visited[node] = true;

			for (int i = 0; i <6; ++i)
			{

				int x1 = x + row[i];
				int y1 = y + col[i];



				if (valid(x1, y1,N))
                {
                    if(row[i]==-1&&col[i]==2)
                    list.push_back("UL");
                else if(row[i]==1&&col[i]==2)
                    list.push_back("UR");
                else if(row[i]==1&&col[i]==-2)
                    list.push_back("LR");

                else if(row[i]==-1&&col[i]==-2)
                    list.push_back("LL");
                     else if(row[i]==2&&col[i]==0)
                    list.push_back("R");
                 else if(row[i]==-2&&col[i]==0)
                    list.push_back("L");

					q.push({x1, y1, dist + 1});}
			}
		}
	}



	cout<<"Impossible";

}


int main()
{
     int N;
    cin >> N;
    int i_start;
    int j_start;
    int i_end;
    int j_end;
     cin >> i_start >> j_start >> i_end >> j_end;

	Node src = { j_start,i_start};


	Node dest = { j_end,i_end};

	BFS(src, dest,N);

	return 0;
}