#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 flag=0,st=0,i=0,x=i_start,y=j_start;
    char a[100][100];
    do
    {
        if((i_end<x)&&(j_end<y))
        {
            x=x-2;
            y=y-1;
            strcpy(a[i],"UL");//printf("%s ",a[i]);
            st=1;
        }else if((x>i_end)&&(y<j_end))
        {
            x=x+2;
            st=1;
            y=y+1;
            strcpy(a[i],"UR");
        }else if((x==i_end)&&(y<j_end))
        {
            y=y+2;
            st=1;
            strcpy(a[i],"R");
        }else if((x<i_end)&&(y<=j_end))
        {
            x=x+2;
            st=1;
            y=y+1;
            strcpy(a[i],"LR");
        }else if((x<i_end)&&(y>j_end))
        {
            x=x+2;
            st=1;
            y=y-1;
            strcpy(a[i],"LL");
        }else if((x==i_end)&&(y>j_end))
        {
            y=y-2;
            st=1;
            strcpy(a[i],"L");//printf("lllll");
        }//printf("%d %d ",x,y);
        i++;
        if(st==0)
        {
            printf("Impossible");flag=1;
            break;
        }st=0;
    }while((x!=i_end)||(y!=j_end));int k;
    if(flag==0)
    {
        printf("%d\n",i);
        
        for(k=0;k<i;k++)
        {
           //printf("poda"); 
            printf("%s ",a[k]);
        }
    }
    //  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;
}