#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <cstdio>

using namespace std;

struct Point{
	int x, y;
};

struct Node{
	Point p;
	int steps;
	vector<Point> path;
};


int main()
{
	int n, sx, sy, fx, fy;
	cin>>n>>sx>>sy>>fx>>fy;
	
	vector< vector<int> > board(n, vector<int>(n, 0));
	
	int yy[] = {-1, 1, 2, 1, -1 -2};
	int xx[] = {-2, -2, 0, 2, 2, 0};
	
	queue<Node> q;
	
	Node start;
	Point sp = {sx, sy};
	int ssteps = 0;
	vector<Point> spath;
	spath.push_back(sp);
	start.p = sp;
	start.steps = ssteps;
	start.path = spath;
	
	board[sx][sy] = 1;
	
	q.push(start);
	
	int stepCount;
	vector<Point> finalPath;
	
	bool found = false;
	
	while(!q.empty()){
		Node front = q.front();
		Point fp = front.p;
		int fsteps = front.steps;
		vector<Point> fpath = front.path;
		q.pop();
		
					if(fp.x == fx && fp.y == fy){
						//cout<<"XYZ "<<fsteps<<endl;
						stepCount = fsteps + 1;
						finalPath = fpath;
						finalPath.push_back({fx, fy});
						found = true;
						break;
					}
		
		for(int k=0; k<6; k++){
			Point tp;
			//cout<<"no error @ i = "<<k<<endl;
			switch(k){
				case 0:
					tp.x = fp.x - 2;
					tp.y = fp.y - 1;
					break;
				
				case 1:
					tp.x = fp.x - 2;
					tp.y = fp.y + 1;
					break;
				
				case 2:
					tp.x = fp.x;
					tp.y = fp.y + 2;
					break;
				
				case 3:
					tp.x = fp.x + 2;
					tp.y = fp.y + 1;
					break;
				
				case 4:
					tp.x = fp.x + 2;
					tp.y = fp.y - 1;
					break;
				
				case 5:
					tp.x = fp.x;
					tp.y = fp.y - 2;
					break;
			}
			
			if(tp.x >= 0 && tp.x < n && tp.y >= 0 && tp.y < n){
				
				if(board[tp.x][tp.y] == 0){
					
					//cout<<"("<<tp.x<<","<<tp.y<<") Steps "<<fsteps<<endl;
					Node newNode;
					newNode.p = tp;
					newNode.steps = fsteps + 1;
					newNode.path = fpath;
					newNode.path.push_back(tp);
					board[tp.x][tp.y] = 1;
					q.push(newNode);
				}
			}
		}
	}
	
	if(found){
	
		cout<<(stepCount-1)<<endl;
	
		for(int i=1; i<stepCount; i++){
			//cout<<finalPath[i].x<<","<<finalPath[i].y<<endl;
			Point curr = finalPath[i];
			Point prev = finalPath[i-1];
			
			//int yy[] = {-1, 1, 2, 1, -1 -2};
			//int xx[] = {-2, -2, 0, 2, 2, 0};
	
			if(curr.x == prev.x - 2 && curr.y == prev.y - 1){
				cout<<"UL ";
			}
			else if(curr.x == prev.x - 2 && curr.y == prev.y + 1){
				cout<<"UR ";
			}
			else if(curr.x == prev.x + 0 && curr.y == prev.y + 2){
				cout<<"R ";
			}
			else if(curr.x == prev.x + 2 && curr.y == prev.y + 1){
				cout<<"LR ";
			}	
			else if(curr.x == prev.x + 2 && curr.y == prev.y - 1){
				cout<<"LL ";
			}
			else{
				cout<<"L ";
			}
		
		}
	}
	else{
		cout<<"Impossible"<<endl;
	}
	
	
	return 0;
}