#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int t1[6]={-2,-2,0,2,2,0};
int t2[6]={-1,1,2,1,-1,-2};
int visited[200][200];
int n,w=0; 
char c[500],c1,c2,c3;
struct Node
{
    int x,y,dist;
    char a,b,e;
};
int front=0,rear=-1;
struct Node q[200];
int valid(int x,int y)
{
    if(x<0||y<0||x>=n||y>=n)
        return 0;
    else
        return 1;
}

int printShortestPath(int n,struct Node src,struct Node dest) {
    //  Print the distance along with the sequence of moves.
    q[++rear]=src;
    while(front!=rear+1)
    {
        struct Node p=q[front++];
        int x=p.x;
        int y=p.y;
        int dist=p.dist;
        
        if(!visited[x][y])
        {
            visited[x][y]=1;
            c[w]=p.a;
            w++;
            c[w]=p.b;
            w++;
            c[w]=p.e;
            w++;
            
            if(x==dest.x && y==dest.y)
            {
                for(int i=0;i<w;i++)
                {
                    if(c[i]!='c')
                    printf("%c",c[i]);
                }
                printf("\n");
                printf("%d",dist);
                return 0;
                
           
            }
            for(int i=0;i<6;i++)
            {
                
                int x1=x+t1[i];
                int y1=y+t2[i];
                if(valid(x1,y1))
                {
                    
                   if(t1[i]==-2)
                    {
                        if(t2[i]==-1)
                        {
                             c1='U';
                             c2='L';
                             c3=' ';
                        }
                        if(t2[i]==1)
                        {
                             c1='U';
                             c2='R';
                            c3=' ';
                        }
                    }
                    if(t1[i]==2)
                    {
                        if(t2[i]==1)
                        {
                             c1='L';
                             c2='R';
                             c3=' ';
                        }
                        if(t2[i]==-1)
                        {
                             c1='L';
                            c2='L';
                            c3=' ';
                        }
                    }
                    if(t1[i]==0)
                    {
                        if(t2[i]==2)
                        {
                             c1='R';
                             c2='c';
                             c3=' ';
                        }
                        if(t2[i]==-2)
                        {
                             c1='L';
                             c2='c';
                            c3=' ';
                        }
                    } 
              struct  Node s={x1,y1,dist+1,c1,c2,c3};
                q[++rear]=s;
                    
                }
            }
        }
    }
    //return -1;
    printf("Impossible");
    return 0;
}

int main() {
    
    scanf("%i", &n);
    int s1; 
    int s2; 
    int d1; 
    int d2; 
    for(int i=0;i<200;i++)
    {
        for(int j=0;j<200;j++)
        {
            visited[i][j]=0;
        }
    }
    
    scanf("%i %i %i %i",&s1,&s2,&d1,&d2);
   struct  Node src={s1,s2,0};
    struct Node dest={d1,d2,0};
    printShortestPath(n,src,dest);
    //printf("%d",d);
    return 0;
}