#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <limits.h>
#include <string.h>
char path[200][3];
int x = 0, flag = 0;

int fun(int **arr, int xi, int yi, int xe, int ye, int n)
{
	if(xi == xe && ye == yi) return 1;
	
	if(xi - 1 >= 0 && yi - 2 >= 0)
	{
		if(arr[xi - 1][yi - 2] == 0 && flag == 0)
		{
			arr[xi - 1][yi - 2] = 1;
			int ul = fun(arr, xi - 1, yi - 2, xe, ye, n);
			if(ul == 1) 
			{
				path[x][0] = 'U';
				path[x][1] = 'L';
				path[x][2] = '\0';
				x++;
				return 1;
			}
		}
	}
    else if(xi + 1 <= n - 1 && yi - 2 >= 0)
	{
		if(arr[xi + 1][yi - 2] == 0 && flag == 0)
		{
			arr[xi + 1][yi - 2] = 1;
			int ur = fun(arr, xi + 1, yi - 2, xe, ye, n);
			if(ur == 1) 
			{
				path[x][0] = 'U';
				path[x][1] = 'R';
				path[x][2] = '\0';
				x++;
				return 1;
			}
		}	
	}
	else if(xi + 2 <= n - 1)
	{
		if(arr[xi + 2][yi] == 0 && flag == 0)
		{
			arr[xi + 2][yi] = 1;
			int r = fun(arr, xi + 2, yi, xe, ye, n);
			if(r == 1) 
			{
				path[x][0] = 'R';
				path[x][1] = '\0';
				path[x][2] = '\0';
				x++;
				return 1;
			}
		}
	}
    else if(xi + 1 <= n - 1 && yi + 2 <= n - 1)
	{
		if(arr[xi + 1][yi + 2] == 0 && flag == 0)
		{
			arr[xi + 1][yi + 2] = 1;
			int lr = fun(arr, xi + 1, yi + 2, xe, ye, n);
			if(lr == 1) 
			{
				path[x][0] = 'L';
				path[x][1] = 'R';
				path[x][2] = '\0';
				x++;
				return 1;
			}
		}
	}
    else if(xi - 1 >= 0 && yi + 2 <= n - 1)
	{
		if(arr[xi - 1][yi + 2] == 0 && flag == 0)
		{
			arr[xi - 1][yi + 2] = 1;
			int ll = fun(arr, xi - 1, yi + 2, xe, ye, n);
			if(ll == 1) 
			{
				path[x][0] = 'L';
				path[x][1] = 'L';
				path[x][2] = '\0';
				x++;
				return 1;
			}
		}
	}
    else if(xi - 2 >= 0)
	{
		if(arr[xi - 2][yi] == 0 && flag == 0)
		{
			arr[xi - 2][yi] = 1;
			int l = fun(arr, xi - 2, yi, xe, ye, n);
			if(l == 1) 
			{
				path[x][0] = 'L';
				path[x][1] = '\0';
				path[x][2] = '\0';
				x++;
				return 1;
			}
		}
	}
	return 0;	
}




int main(void)
{
	int n, xi, yi, xe, ye, i, j;
	scanf("%d", &n);
	scanf("%d %d %d %d", &xi, &yi, &xe, &ye);
	int **arr = (int **)malloc(n*sizeof(int *));
	for(i = 0; i < n; i++) arr[i] = (int *)malloc(n*sizeof(int));
	
	for(i = 0; i < n; i++)
	{
		for(j = 0; j < n; j++) arr[i][j] = 0;
	}
	/*
	int result = fun(arr, xi, yi, xe, ye, n);
	if(result == 0) printf("Impossible\n");
	else
	{
		printf("%d\n", x + 1);
		for(i = 0; i < x; i++) printf("%s ", path[i]);
	}*/
    printf("Impossible\n");
	return 0;
}