<?php

$handle = fopen ("php://stdin", "r");
function printShortestPath($n, $i_start, $j_start, $i_end, $j_end) {
    //  Print the distance along with the sequence of moves.
    if(abs($i_end - $i_start) % 2 == 1 || (abs($i_end - $i_start)/2) % 2 != abs($j_end - $j_start) % 2){
        echo 'Impossible';
    } else {
        $result = '';
        $moves = 0;
        $curPos = array($i_start, $j_start);
        
        while($i_end != $curPos[0] || $j_end != $curPos[1]){
            if($i_end != $curPos[0]){
                if($i_end > $curPos[0]){
                        $curPos[0] += 2;
                        $result .= 'L';
                } elseif($i_end < $curPos[0]){
                        $curPos[0] -= 2;
                        $result .= 'U';
                }
                
                if($j_end < $curPos[1] || $curPos[1] == $n - 1){
                        $curPos[1] -= 1;
                        $result .= 'L ';
                } else {
                        $curPos[1] += 1;
                        $result .= 'R ';
                }
            } else {
                if($j_end < $curPos[1] || $curPos[1]){
                        $curPos[1] -= 2;
                        $result .= 'L ';
                } else {
                        $curPos[1] += 2;
                        $result .= 'R ';
                }
            }
            $moves++;
        }
        echo $moves . "\n";
        echo $result . "\n";
    }
}

fscanf($handle, "%i",$n);
fscanf($handle, "%i %i %i %i", $i_start, $j_start, $i_end, $j_end);
printShortestPath($n, $i_start, $j_start, $i_end, $j_end);

?>