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

int mat[200][200];
int vis[200][200];
int xmov[6]={-2,-2,0,2,2,0};
int ymov[6]={-1,1,2,1,-1,-2};
int que[40000];
int head=-1;
int tail=-1;
int min_cnt=50000;

int isvalid(int n,int x,int y,int cnt)
{
    if(x>=0 && x<n && y>=0 && y<n)
    {
        if(!vis[x][y])
        {           
             return 1;
        }   
        else
        {
            //printf("vis [%d] [%d] =%d cnt=%d\n",x,y,vis[x][y],cnt);
#if 0            
            if(cnt<vis[x][y])
            {
                vis[x][y]=cnt+1;            
                return 1;
            }
#endif            
        }
    }
    return 0;
}
int isvalid1(int n,int x,int y)
{
    if(x>=0 && x<n && y>=0 && y<n)
       return 1;

    return 0;
}
void printShortestPath(int n,int cnt, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    int i=0;
    vis[i_start][j_start]=cnt;    
     //printf("vis [%d] [%d] =%d\n",i_start,j_start,cnt);
    for(i=0;i<6;i++)
    {
        int new_i = i_start+xmov[i];
        int new_j = j_start+ymov[i];
        if(isvalid(n,new_i,new_j,cnt))
        {            
            
            if((i_end == new_i)&&(j_end== new_j ))
            {
               //dest find                
                //printf("Find cnt =%d \n",cnt);
                if(min_cnt>cnt)
                {
                    min_cnt=cnt;
                    mat[new_i][new_j]=i;
                    //printf("mat[%d][%d]= %d\n",new_i,new_j,mat[new_i][new_j]);
                }
                break;
            }
            else
            {
                mat[new_i][new_j]=i;
                //printf("mat[%d][%d]= %d\n",new_i,new_j,mat[new_i][new_j]);         
                printShortestPath(n,cnt+1,new_i,new_j,i_end,j_end);
            }
        }
    }
        
}

int main() {
    int n; 
    scanf("%i", &n);
    int i_start; 
    int j_start; 
    int i_end; 
    int j_end; 
    int i,j;
    int c=0;
    int arr[500]={0};   
    char *ptr[]={"UL","UR","R","LR","LL","L"};
    scanf("%i %i %i %i", &i_start, &j_start, &i_end, &j_end);
    printShortestPath(n,1, i_start, j_start, i_end, j_end);

    if(min_cnt<50000)
    {
        printf("%d\n",min_cnt );
#if 1
        for(i=0;i<min_cnt;i++)
        {
            c=mat[i_end][j_end];
            arr[i]=c;
            //printf("%s ",ptr[c]);        
            i_end-=xmov[c] ;
            j_end-=ymov[c] ;
        }
        for(i=1;i<=min_cnt;i++)
        {
            printf("%s ",ptr[arr[min_cnt-i]]);
        }
         
#endif        
    }
    else
        printf("Impossible");
    return 0;
}