process.stdin.resume();
process.stdin.setEncoding('ascii');

var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;

process.stdin.on('data', function (data) {
    input_stdin += data;
});

process.stdin.on('end', function () {
    input_stdin_array = input_stdin.split("\n");
    main();    
});

function readLine() {
    return input_stdin_array[input_currentline++];
}

/////////////// ignore above this line ////////////////////


let priority = {
  "UL" : 1,
  "UR" : 2,
  "R" : 3,
  "LR" : 4,
  "LL" : 5,
  "L" : 6
}

function BubbleSort(A)
{                           
    var n = A.length;
    for (var i = 0; i < n-1; i++)
     { for (var j = 0; j < n-1-i; j++)
        { if (priority[A[j+1]] < priority[A[j]])
           { var t = A[j+1]; A[j+1] = A[j]; A[j] = t; }
        }
     }                     
    return A;  
}


function printShortestPath(n, i_start, j_start, i_end, j_end) {
    if(Math.abs(i_start-i_end) % 4 == 0 && Math.abs(j_start - j_end) % 2 == 1){
        console.log("Impossible");
        return;
    }
    
    //  Print the distance along with the sequence of moves.
  if(
        (Math.abs(i_start-i_end) % 4 == 0 && Math.abs(j_start - j_end) % 2 == 0)
        ||
        (Math.abs(i_start-i_end) % 2 == 0 && Math.abs(j_start - j_end) % 2 == 1)
    ) {
      
        if(i_start == i_end && Math.abs(j_start - j_end) % 2 == 1) {
            console.log("Impossible");
            return;
        }
        
        let ar = [],
            moves = 0;
        while(i_start != i_end || j_start != j_end) {
            if((i_start - i_end > 0 && (j_start - j_end >0 || j_start == j_end)) && j_start-1 >=0) {//
                ar.push("UL");
                i_start -=2;
                j_start -=1;
            } else if ((i_start - i_end > 0 && (j_start - j_end < 0 || j_start == j_end)) && j_start+1 <=n) {//
                ar.push("UR");
                i_start -=2;
                j_start +=1;
            }  else if((i_start - i_end < 0 && (j_start - j_end < 0  || j_start == j_end)) && j_start+1 <=n) {//
                ar.push("LR");          
                i_start +=2;
                j_start +=1;
            } else if(i_start - i_end < 0 && (j_start - j_end >0 || j_start == j_end)) {//
                ar.push("LL"); 
                i_start +=2;
                j_start -=1;
            } else if((i_start == i_end && j_start - j_end < 0) || ((i_start - i_end)<0 && (j_start - j_end)<0) && Math.abs(j_start - j_end) > 1) {//->
                ar.push("R");
                j_start +=2;
            } else if(i_start == i_end &&  j_start - j_end > 0) {//<-
                ar.push("L");   
                j_start -=2;
            }
            moves++;
        }
        console.log(moves);      
        console.log(BubbleSort(ar).join(" "));
    } else {
       console.log("Impossible");
    }
}

function main() {
    var n = parseInt(readLine());
    var i_start_temp = readLine().split(' ');
    var i_start = parseInt(i_start_temp[0]);
    var j_start = parseInt(i_start_temp[1]);
    var i_end = parseInt(i_start_temp[2]);
    var j_end = parseInt(i_start_temp[3]);
    printShortestPath(n, i_start, j_start, i_end, j_end);

}