import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
class State{
    int count = 0;
    String moves = "";
    int i_curr=-1;
    int j_curr=-1;
    public State(int cnt,String mv, int i, int j){
        count = cnt;
        moves = mv;
        i_curr = i;
        j_curr = j;
    }
}
public class Solution {

    static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
        //  Print the distance along with the sequence of moves.
        State []queue = new State[6*n*n];
        State state = new State(0,"",i_start,j_start);
        queue[0] = state;
        int in = 0,fi = 1,dx=0,dy=0,i_new = 0, j_new;
        int board[][] = new int[n][n];
        board[state.i_curr][state.j_curr] = 1;
        boolean found = false; 
        int [][] transitions = {{-2,-1},{-2,1},{0,2},{2,1},{2,-1},{0,-2}}; 
        String []move_names = {"UL","UR","R","LR","LL","L"};
        int i=0,j=0,k=0;
        while(in<fi){
            state = queue[in++];
           // System.out.println(in+" "+state.i_curr+" "+state.j_curr+" "+state.count+" "+state.moves);
            if((state.i_curr == i_end) && (state.j_curr == j_end)){
                found = true;
                System.out.println(state.count);
                System.out.println(state.moves.trim());
                break;
            }
            for(i=0;i<move_names.length;i++){
                dx = transitions[i][0];
                dy = transitions[i][1];
                i_new = state.i_curr + dx;
                j_new = state.j_curr + dy;
                if(i_new>-1 && i_new <n && j_new>-1 && j_new <n && board[i_new][j_new] == 0){
                    board[i_new][j_new] = 1;
                    State newState = new State(state.count+1,state.moves+" "+move_names[i],i_new,j_new);
                    queue[fi++] = newState;
                }
            }
          //  System.out.println("--"+in+" "+fi);
            
        }
        if(!found)
            System.out.println("Impossible");
    }
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int i_start = in.nextInt();
        int j_start = in.nextInt();
        int i_end = in.nextInt();
        int j_end = in.nextInt();
        printShortestPath(n, i_start, j_start, i_end, j_end);
        in.close();
    }
}