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) {
        if ((i_start % 2) != (i_end % 2)) {
            System.out.println("Impossible");
        } else if (((Math.abs(i_start-i_end)/2)%2 == 0) && (j_end % 2 != j_start % 2)) {
            System.out.println("Impossible");
        } else if (((Math.abs(i_start-i_end)/2)%2 == 1) && (j_end % 2 == j_start % 2)) {
            System.out.println("Impossible");
        } else {
            int counter = 0;
            ArrayList<String> directions = new ArrayList<String>();
            while (i_start != i_end || j_start != j_end) {
                if (i_start > i_end) {
                    if (j_start >= j_end) {
                        i_start -= 2;
                        j_start -= 1;
                        directions.add(new String("UL"));
                    } else {
                        i_start -= 2;
                        j_start += 1;
                        directions.add(new String("UR"));
                    }
                } else if (i_start < i_end) {
                    if (j_start > j_end) {
                        i_start += 2;
                        j_start -= 1;
                        directions.add(new String("LL"));
                    } else {
                        i_start += 2;
                        j_start += 1;
                        directions.add(new String("LR"));
                    }
                } else {
                    if (j_start < j_end) {
                        j_start += 2;
                        directions.add(new String("R"));
                    } else {
                        j_start -= 2;
                        directions.add(new String("L"));
                    }
                }
                counter++;
            }
            System.out.println(counter);
            for (String dir : directions) {
                System.out.print(dir + " ");
            }
        }
    }

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