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

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    int arr[200],k=0,count=0,flag=1;
    while(1)
    {
        if((i_start<0||i_start>=n)||(j_start<0||j_start>=n))
        {
      //      printf("alan");
            flag=0;
            break;
        }
        if(i_start==i_end&&j_start==j_end)
        {
            flag=1;
            break;
        }
        if(i_end<i_start&&j_end<j_start)
        {
            count++;
            arr[k++]=1;
            i_start-=2;
            j_start-=1;
            if(i_end>i_start&&j_end>j_start)
            {
                flag=0;
                break;
            }
        }
        else if(i_end<i_start&&j_end>j_start)
        {
            count++;
            arr[k++]=2;
            i_start-=2;
            j_start+=1;
            if(i_end>i_start&&j_end<j_start)
            {
                flag=0;
                break;
            }
        }
        else if(i_end==i_start&&j_end>j_start)
        {
            count++;
            arr[k++]=3;
            j_start+=2;
            if(i_end==i_start&&j_end<j_start)
            {
                flag=0;
                break;
            }
        }
        else if(i_end>i_start&&j_end>j_start)
        {
            count++;
            arr[k++]=4;
            i_start+=2;
            j_start+=1;
            if(i_end<i_start&&j_end<j_start)
            {
                flag=0;
                break;
            }
        }
        else if(i_end>i_start&&j_end<j_start)
        {
            count++;
            arr[k++]=5;
            i_start+=2;
            j_start-=1;
            if(i_end<i_start&&j_end>j_start)
            {
                flag=0;
                break;
            }
        }
        else if(i_end==i_start&&j_end<j_start)
        {
            count++;
            arr[k++]=6;
            j_start-=2;
            if(i_end==i_start&&j_end>j_start)
            {
                flag=0;
                break;
            }
        }
        else if(i_end<i_start&&j_end==j_start)
        {
            count++;
            arr[k++]=1;
            i_start-=2;
            j_start-=1;
            if(i_end>i_start)
            {
                flag=0;
                break;
            }
        }
        else if(i_end>i_start&&j_end==j_start)
        {
            count++;
            arr[k++]=4;
            i_start+=2;
            j_start+=1;
            if(i_end<i_start)
            {
                flag=0;
                break;
            }
        }
   //     printf("%d %d\n",i_start,j_start);
    }
    if(flag==0)
        printf("Impossible");
    else
    {
        printf("%d\n",count);
        for(int i=0;i<count;i++)
        {
            if(arr[i]==1)
                printf("UL ");
            else if(arr[i]==2)
                printf("UR ");
            else if(arr[i]==3)
                printf("R ");
            else if(arr[i]==4)
                printf("LR ");
            else if(arr[i]==5)
                printf("LL ");
            else if(arr[i]==6)
                printf("L ");
        }
    }
    //  Print the distance along with the sequence of moves.
}

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;
}