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 yDiff = i_end - i_start;
        boolean yendIsAbove = false;
        boolean xIsRight = true;

        if (yDiff < 0) {
            yendIsAbove = true;
            yDiff = -yDiff;
        }

        if (i_start > n || i_end > n || j_start > n || j_end > n || i_start < 0 || i_end < 0 || j_start < 0 || j_end < 0 ) {
            System.out.println("Impossible");
        } else if (yDiff%2 != 0) {
            System.out.println("Impossible");
        } else {
            int m = yDiff/2;
            int xDiff = j_end - j_start;
            if (xDiff < 0) {
                xIsRight = false;
                xDiff = -xDiff;
            }

            if (((m%2 != 0) && (xDiff%2 == 0)) || ((m%2 == 0) && (xDiff%2 != 0))) {
                System.out.println("Impossible");
            } else {
                int noOfMovesInY = m;
                if (xDiff < noOfMovesInY) {
                    System.out.println(noOfMovesInY);
                    if (yendIsAbove) {
                        while (noOfMovesInY != 0) {
                            xDiff = j_end - j_start;
                            if (xDiff == 0) {
                                System.out.print("UL ");
                                j_start--;
                            } else if (xDiff > 0) {
                                System.out.print("UR ");
                                j_start++;
                            } else {
                                System.out.print("UL ");
                                j_start--;
                            }
                            noOfMovesInY--;
                        }
                    } else {
                        while (noOfMovesInY != 0) {
                            xDiff = j_end - j_start;
                            if (xDiff == 0) {
                                System.out.print("LR ");
                                j_start++;
                            } else if (xDiff > 0){
                                System.out.print("LR ");
                                j_start++;
                            } else {
                                System.out.print("LL ");
                                j_start--;
                            }
                            noOfMovesInY--;
                        }
                    }
                } else {
                    int extraMovesForx = (xDiff-noOfMovesInY)/2;
                    System.out.println(noOfMovesInY + extraMovesForx);
                    String height;
                    String side;

                    if (yendIsAbove) {
                        if (xIsRight) {
                            height = "UR ";
                            side = "R ";
                        } else {
                            height = "UL ";
                            side = "L ";
                        }

                        for (int i = 0 ; i < noOfMovesInY ; i++) {
                            System.out.print(height);
                        }

                        for (int i = 0 ; i < extraMovesForx ; i++) {
                            System.out.print(side);
                        }
                    } else {
                        if (xIsRight) {
                            height = "LR ";
                            side = "R ";
                           
                            for (int i = 0 ; i < extraMovesForx ; i++) {
                                System.out.print(side);
                            }

                            for (int i = 0 ; i < noOfMovesInY ; i++) {
                                System.out.print(height);
                            }
                        } else {
                            height = "LL ";
                            side = "L ";
                            
                            for (int i = 0 ; i < noOfMovesInY ; i++) {
                                System.out.print(height);
                            }

                            for (int i = 0 ; i < extraMovesForx ; i++) {
                                System.out.print(side);
                            }
                        }
                    }
                }
            }
        }
    }

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