#include<stdio.h>
#include<queue>
#include<string.h>

using namespace std;

int row[] = {-1, 1, 2, 1, -1,-2};
int col[] = {-2,-2, 0, 2, 2, 0};

int print[100],jalan[200][200];

int x,y,dis,catat[200][200],n,ytujuan,xtujuan,xasal,yasal,step;
bool visit[200][200];

queue <pair<int,int> > Q;
void BFS (){
    Q.push(make_pair(xasal,yasal));
    memset(catat,0,sizeof(catat));
    memset(visit,0,sizeof(visit));

    while (!Q.empty()){
        x   = Q.front().first;
        y   = Q.front().second;
        dis = catat[x][y];
        Q.pop();
        if (!visit[x][y]){
            visit[x][y] = true;
            if (x==xtujuan && y == ytujuan){
                step = dis;
                break;
            }
            for (int i =0; i<6;i++){
                int y1 = y+row[i];
                int x1 = x+col[i];

                if (x1>=0 && y1>=0 && x1<n && y1<n && !visit[x1][y1]){

                    if (catat[x1][y1]==0){
                        jalan[x1][y1] = i;
                        Q.push(make_pair(x1,y1));
                        catat[x1][y1] = dis+1;
                    }
                }
            }
        }
    }
    return;
}

int main (){
    scanf("%d",&n);
    scanf("%d%d%d%d",&xasal,&yasal,&xtujuan,&ytujuan);
    BFS();
 /*   for (int i = 0;i<n;i++){
        for (int j = 0;j<n;j++){
            printf("%d ", catat[i][j]);
        }
        printf("\n");
    }
    */
    if (step==0){
        printf("Impossible\n");
    } else {
        for (int i = step-1; i>=0;i-- ){
            if (jalan[x][y]==0){
                print[i] = 0;
                x = x+col[3];
                y = y+row[3];
            } else if (jalan[x][y]==1){
                print[i] = 1;
                x = x+col[4];
                y = y+row[4];
            } else if (jalan[x][y]==2){
                print[i] = 2;
                x = x+col[5];
                y = y+row[5];
            } else if (jalan[x][y]==3){
                print[i] = 3;
                x = x+col[0];
                y = y+row[0];
            } else if (jalan[x][y]==4){
                print[i] = 4;
                x = x+col[1];
                y = y+row[1];
            } else if (jalan[x][y]==5){
                print[i] = 5;
                x = x+col[2];
                y = y+row[2];
            }
        }
        printf("%d\n",step);
        for (int i = 0; i<step;i++){
            if (print[i]==0){
                printf("UL");
            } else if (print[i]==1){
                printf("UR");
            } else if (print[i]==2){
                printf("R");
            }else if (print[i]==3){
                printf("LR");
            }else if (print[i]==4){
                printf("LL");
            }else if (print[i]==5){
                printf("L");
            }

            if (i==step-1){
                printf("\n");
            }else {
                printf(" ");
            }
        }
    }

return 0;
}