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

public class Solution {
    //UL, UR, R, LR, LL, L.
    static int[][] positions = new int[][]{{-2, -1}, {-2, 1}, {0, 2}, {2, 1}, {2, -1}, { 0, -2}};
    static String[] moves = new String[]{"UL", "UR", "R", "LR", "LL",  "L"};
    static boolean[][] visited =  null;                   
    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.
        visited = new boolean[n][n];
        Map<String, String[]> parents = new HashMap<>();
        int[][] dist = new int[n][n];
        for(int[] d:dist)
            Arrays.fill(d, Integer.MAX_VALUE);
        int level = 0;
        
        if(i_start == i_end&& j_start== j_end) {
            System.out.println("0");
            System.out.println("");
            return;
        }
        visited[i_start][j_start] = true;
        Queue<int[]> queue = new LinkedList<>();
        queue.offer(new int[]{i_start, j_start});
        while(!queue.isEmpty()){
            int size = queue.size();
            level++;
            for(int i = 0;i<size;i++){
                int[] node = queue.poll();
                for(int k = 0;k<positions.length;k++){
                    int tempx = positions[k][0]+node[0];
                    int tempy = positions[k][1]+node[1];           
                    int[] newNode = new int[]{tempx, tempy};
                    if(tempx>=0 && tempy>=0 && tempx<n && tempy<n && !visited[tempx][tempy]){
                        if(level<dist[tempx][tempy]){
                            parents.put(tempx+","+tempy, new String[]{node[0]+","+node[1], moves[k]});
                        }
                        if(tempx == i_end&& tempy== j_end ){
                            if(level<dist[i_end][j_end]){
                                dist[i_end][j_end] = level;
                                break;
                            }
                        }
                        visited[tempx][tempy] = true;
                        queue.offer(newNode);
                    }
                }
            }
        }
        
        //boolean found = dfs( n,i_start, j_start, i_end, j_end, list, 0);
        if(dist[i_end][j_end]!=Integer.MAX_VALUE){            
            System.out.println(dist[i_end][j_end]);
            StringBuilder sb = new StringBuilder();
            String temp = i_end+","+ j_end;           
            while(parents.containsKey(temp)){
                sb.insert(0, parents.get(temp)[1] + " ");
                temp = parents.get(temp)[0];
            }
            System.out.println(sb.toString().trim());
            return;
        }
        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();
    }
}