import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    public static boolean isValid(int n, int imoveto, int jmoveto) {
        return imoveto >=0 && imoveto <n && jmoveto >=0 && jmoveto <n;
    }
    
    public static void dfs(int n, int i_start, int j_start, boolean[][] marked, int[][] distto, String[][] edgeto) {
        marked[i_start][j_start] = true;
        int distcurr = distto[i_start][j_start];
        //distcurr should start at 0
        //dont forget to mark the start place as 'start' in edgeto
       //UL
        if (isValid(n,i_start-2, j_start-1)) {
            if (distcurr +1 < distto[i_start-2][j_start-1]) {
            edgeto[i_start-2][j_start-1] = "LR";
                distto[i_start-2][j_start-1] = distcurr +1;
            dfs(n,i_start-2, j_start-1,marked,distto, edgeto);
            }
        }
        // UR
        if (isValid(n,i_start-2, j_start+1) ) {
            if (distcurr +1 < distto[i_start-2][j_start+1]) { 
                distto[i_start-2][j_start+1] = distcurr +1;
                edgeto[i_start-2][j_start+1] = "LL";
            dfs(n,i_start-2, j_start+1,marked,distto,edgeto);
            }
        }
        // R
        if (isValid(n,i_start, j_start+2) ) {
            if (distcurr +1 < distto[i_start][j_start+2]) {
            distto[i_start][j_start+2] = distcurr +1;
                edgeto[i_start][j_start+2] = "L";
            dfs(n,i_start, j_start+2,marked,distto,edgeto);
            }
        }
        
        // LR
        if (isValid(n,i_start+2, j_start+1) ) {
            if (distcurr +1 < distto[i_start+2][j_start+1]) {
            edgeto[i_start +2][j_start+1] = "UL";
                distto[i_start+2][j_start+1] = distcurr +1;
            dfs(n,i_start+2,j_start+1,marked,distto,edgeto);
            }
        }
        
        // LL
        if (isValid(n,i_start+2, j_start-1) ) {
            if (distcurr +1 < distto[i_start+2][j_start-1]) {
            edgeto[i_start+2][j_start-1] = "UR";
                distto[i_start+2][j_start-1] = distcurr +1;
            dfs(n,i_start+2, j_start-1,marked,distto,edgeto);
            }
        }
        
        // L
        if (isValid(n,i_start, j_start-2) ) {
            if (distcurr +1 < distto[i_start][j_start-2]) {
            edgeto[i_start][j_start-2] = "R";
                distto[i_start][j_start-2] = distcurr+1;
            dfs(n,i_start, j_start-2,marked,distto,edgeto);
            }
        }
    }
    
    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.
        boolean[][] marked = new boolean[n][n];
        int[][] distto = new int[n][n];
        for (int i = 0; i < n ; i++) {
            for (int j = 0; j < n; j++) {
                distto[i][j] = Integer.MAX_VALUE;
            }
        }
        distto[i_start][j_start] = 0;
        String[][] edgeto = new String[n][n];
        edgeto[i_start][j_start] = "START";
        
        dfs(n,i_start,j_start,marked,distto,edgeto);
        if (marked[i_end][j_end] == false) {
            System.out.println("Impossible");
            return;
        }
        System.out.println(distto[i_end][j_end]);
        
        int r = i_end;
        int c = j_end;
        String s = "";
        List<String> l = new ArrayList<String>();
        while(edgeto[r][c] != "START") {
            String temp = edgeto[r][c];
            if (temp.equals("LR")) 
            {l.add("UL");
             r = r+2;
             c = c+1;
            }
            if (temp.equals("LL")) {
                l.add("UR");
            r = r+2;
                c = c-1;
        }
            if (temp.equals("L")) {
                l.add("R");
        c = c-2;
    }
            if (temp.equals("R")) {
                l.add("L");
                c = c+2;
            }
            if (temp.equals("UL")) {
                l.add("LR");
                r = r-2;
                c = c-1;
            }
            if (temp.equals("UR")) {
                l.add("LL");
                r =r -2;
                c = c+1;
            }
        }
        Collections.reverse(l);
        for (int i = 0;i <l.size();i++) {
            s = s + l.get(i) + " ";
        }
        System.out.println(s);
    }

    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();
    }
}