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

int n;
 
struct Point
{
    int x;
    int y;
};
 
struct queueNode
{
    Point pt;  
    int dist; 
    vector<int> r;
};

bool isValid(int row, int col)
{
    return (row >= 0) && (row < n) &&
           (col >= 0) && (col < n);
}
 
int colNum[] = {-1, 1, 2, 1,-1,-2};
int rowNum[] = {-2, -2, 0, 2,2,0};
 
int BFS(Point src, Point dest){
    bool visited[n][n];
    memset(visited, false, sizeof visited);
    
    visited[src.x][src.y] = true;

    queue<queueNode> q;
     
    queueNode s = {src, 0};
    q.push(s);  
 
    while (!q.empty())
    {
        queueNode curr = q.front();
        Point pt = curr.pt;
        
        if (pt.x == dest.x && pt.y == dest.y){
            cout<< curr.dist<<endl;
            for(int i=0;i<curr.r.size();i++){
            	int a=curr.r[i];
            	//cout<<a<<" ";
            	switch(a){
            		case 1: cout<<"UL ";break;
            		case 2: cout<<"UR ";break;
            		case 3: cout<<"R ";break;
            		case 4: cout<<"LR ";break;
            		case 5: cout<<"LL ";break;
            		case 6: cout<<"L ";break;
				}
			}
			return curr.dist;
 		}
        q.pop();
 
        for (int i = 0; i < 6; i++)
        {
            int row = pt.x + rowNum[i];
            int col = pt.y + colNum[i];
            if (isValid(row, col) && !visited[row][col])
            {
                visited[row][col] = true;
                queueNode Adjcell = { {row, col}, curr.dist + 1 };
                Adjcell.r=curr.r;
                Adjcell.r.push_back(i+1);
                q.push(Adjcell);
            }
        }
    }
 
    return INT_MAX;
}

int main()
{
	cin>>n;
	int x1,y1,x2,y2;
	cin>>x1>>y1>>x2>>y2;
    Point source = {x1, y1};
    Point dest = {x2, y2};
 
    int dist = BFS(source, dest);
 
    if (dist == INT_MAX)
        cout << "Impossible";
}