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

public class Solution {

    static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
        int[][] dist = new int[n][n];
        for (int i = 0; i < n; i++) Arrays.fill(dist[i], -1);
        Point[][] parent = new Point[n][n];
        Queue<Point> open = new LinkedList<Point>();
        dist[i_start][j_start] = 0;
        open.add(new Point(i_start, j_start));
        while (!open.isEmpty()) {
            Point current = open.remove();
            int i = current.i;
            int j = current.j;
            if (i==i_end && j==j_end) break;
            int d = dist[i][j];
            if (i >= 2) {
            	if (j >= 1 && dist[i-2][j-1]==-1) {
	                dist[i-2][j-1] = d+1;
	                parent[i-2][j-1] = current;
	                open.add(new Point(i-2, j-1));
            	}
            	if (j < n-1 && dist[i-2][j+1]==-1) {
	                dist[i-2][j+1] = d+1;
	                parent[i-2][j+1] = current;
	                open.add(new Point(i-2, j+1));
            	}
            }
            if (j < n-2 && dist[i][j+2]==-1) {
                dist[i][j+2] = d+1;
                parent[i][j+2] = current;
                open.add(new Point(i, j+2));
            }
            if (i < n-2) {
            	if (j < n-1 && dist[i+2][j+1]==-1) {
	                dist[i+2][j+1] = d+1;
	                parent[i+2][j+1] = current;
	                open.add(new Point(i+2, j+1));
            	}
            	if (j >= 1 && dist[i+2][j-1]==-1) {
	                dist[i+2][j-1] = d+1;
	                parent[i+2][j-1] = current;
	                open.add(new Point(i+2, j-1));
            	}
            }
            if (j >= 2 && dist[i][j-2]==-1) {
                dist[i][j-2] = d+1;
                parent[i][j-2] = current;
                open.add(new Point(i, j-2));
            }
        }
        if (dist[i_end][j_end] > -1) {
        	System.out.println(dist[i_end][j_end]);
        	String ans = "";
        	Point p = new Point(i_end, j_end);
        	while (parent[p.i][p.j] != null) {
        		Point par = parent[p.i][p.j];
        		ans = " " + ans;
        		if (p.j > par.j) ans = "R" + ans;
        		else ans = "L" + ans;
        		if (p.i > par.i) ans = "L" + ans;
        		else if (p.i < par.i) ans = "U" + ans;
        		p = par;
        	}
        	System.out.println(ans.trim());
        } else 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();
    }
    
    static class Point {
        int i, j;
        public Point(int i, int j) {
            this.i = i;
            this.j = j;
        }
    }
}