#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

//UL, UR, R, LR, LL, L
static int y[6] = {-1, +1, +2, +1, -1, -2};
static int x[6] = {-2, -2, 0, +2, +2, 0};
int vis[201][201];
int min = 2000;
int path[2000];
int isSafe(int nx, int ny, int n)
{
    return ((nx>=0 && nx<n) && (ny>=0 &&ny<n));
}

int printUtil(int n, int cx, int cy, int dx, int dy, const int cval)
{
    if (cval > min)
        return 0; 
    if (cx == dx && cy == dy)
    {
        if (min > cval) {
            min = cval;
            return 1;
        }
        return 0;
    }

    bool is_safe = false;
    vis[cx][cy] = cval;
    for(int i = 0;i<6;i++){
        int nx = cx + x[i];
        int ny = cy + y[i];
        if(isSafe(nx, ny, n) && vis[nx][ny] > cval) {
            if(printUtil(n, nx, ny, dx, dy, cval+1)) {
                is_safe = true;
                path[cval] = i;
            }
        }
    }
    
    return is_safe ? 1 : 0;
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    for(int i = 0; i<n;i++)
    {
        for(int j= 0 ;j<n;j++)
        {
            vis[i][j] = 2000;
            path[j] = -1;
        }
    }
    printUtil(n, i_start, j_start, i_end, j_end, 0);
    if(min!=2000) {
        printf("%d\n", min);
        for(int i= 0;i<min;i++){
            //printf("%d\t", path[i]);
            switch(path[i]){

                case 0:printf("UL ");
                    break;
                case 1:printf("UR ");
                    break;
                case 2:printf("R ");
                    break;
                case 3:printf("LR ");
                    break;
                case 4:printf("LL ");
                    break;
                case 5:printf("L ");
                    break;
                default:
                    printf("%d ", path[i]);
            }
        }
    }else
    {
        printf("Impossible\n");
    }
}

int main() {
    int n; 
    scanf("%i", &n);
    int i_start; 
    int j_start; 
    int i_end; 
    int j_end; 
    scanf("%i %i %i %i", &i_start, &j_start, &i_end, &j_end);
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}