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

int length = -1;
bool checked[200][200] = {0};
int a[200];


void print(int n)
{
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++)
			cout<<checked[i][j]<<" ";	
		cout<<endl;
	}
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end,int b[],int c) {
       static int count = INT_MAX;
       if(i_start<0 || i_start>=n||j_start<0 || j_start>=n || checked[i_start][j_start])
              return;
       if(i_start == i_end && j_start == j_end)
       {
          if(count>c)
          {
        	for(int i=0; i<c; i++)
			a[i] = b[i];
        	count = c;
        	length = count;
          }
          return;
        }
    	checked[i_start][j_start] = 1;
    	b[c] = 1;
        printShortestPath(n,i_start-2,j_start-1,i_end,j_end,b,c+1); // UL
        
        b[c] = 2;
        printShortestPath(n,i_start-2,j_start+1,i_end,j_end,b,c+1); // UR
        
        b[c] = 3;
        printShortestPath(n,i_start,j_start+2,i_end,j_end,b,c+1); // R
        
        b[c] = 4;
        printShortestPath(n,i_start+2,j_start+1,i_end,j_end,b,c+1); // LR
        
        b[c] = 5;
        printShortestPath(n,i_start+2,j_start-1,i_end,j_end,b,c+1); // LL
       
        b[c] = 6;
        printShortestPath(n,i_start,j_start-2,i_end,j_end,b,c+1); // L
       
}

int main() {
    int n;
    int b[200];
    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,b,0);
    if(length == -1)
     cout<<"Impossible"<<endl;
    else
    {
    	cout<<length<<endl;
    	for(int i=0; i<length; i++)
    	{
    		switch (a[i]){
    		
    		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;
    		}
	}
    	cout<<endl;
    	//print(n);
    }
    
    
    return 0;
}