#include <bits/stdc++.h>
#define size 210
#define lli long long int

using namespace std;

bool isValid(lli i,lli j,lli n)
{
	if(i>=0 && i<n && j>=0 && j<n)
		return 1;
	return 0;
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
	
    queue< pair<lli,lli> > q;
	pair<lli,lli> current;
	bool visited[n][n];
	lli dist[n][n];
	lli parentX[n][n],parentY[n][n];
	string node[n][n];
	lli x,y,X,Y,i,j,k;
	
	memset(dist , -1 , sizeof dist);
	
	lli moves[6][2] = {{-2,-1},{-2,1},{0,2},{2,1},{2,-1},{0,-2}};
	string strs[6] = {"UL","UR","R","LR","LL","L"};
	
	
	memset(visited , 0 , sizeof visited);
	dist[i_start][j_start] = 0; visited[i_start][j_start] = 1;parentX[i_start][j_start] = -1;parentY[i_start][j_start] = -1;
	node[i_start][j_start] = "over";
	q.push(make_pair(i_start,j_start));
	
	while(!q.empty())
	{
		current = q.front(); q.pop();
		x = current.first; y = current.second;
		//cout<<x<<":"<<y<<"("<<parentX[x][y]<<","<<parentY[x][y]<<")"<<endl;
		for(i=0;i<6;i++)
		{
			X = x+moves[i][0]; Y = y+moves[i][1];
			if(isValid(X,Y,n) && !visited[X][Y])
			{
				visited[X][Y] = 1;
				dist[X][Y] = dist[x][y]+1;
				parentX[X][Y] = x; parentY[X][Y] = y;
				node[X][Y] = strs[i];
				q.push(make_pair(X,Y));
			}
		}
		
	}
	
	string ans = "";
	
	if(dist[i_end][j_end] == -1)
	{
		cout<<"Impossible"<<endl;
	}
	else{
        
		
		x = i_end; y = j_end;
		stack<string> st;
		while(1)
		{
			if(x == i_start && y==j_start)
				break;
			st.push(node[x][y]);
			X = x;
			x = parentX[x][y];
			y = parentY[X][y];
		}
        cout<<dist[i_end][j_end]<<endl;
		while(!st.empty())
		{
			cout<<st.top()<<" ";
			st.pop();
		}
		cout<<endl;
		
	}
	 
}

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;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}