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) {
        //  Print the distance along with the sequence of moves.
         //checks for impossibles
        int i_current = i_start, j_current = j_start;
        ArrayList<String> queue = new ArrayList<>();

        if (Math.abs(i_start - i_end) % 2 != 0 && i_start - i_end != 0) {
            System.out.println("Impossible");
            return;
        }
        else {
            int c = 2;
            if (i_start > i_end) {
                c = -2;
            }
            while (i_current != i_end) {
                i_current += c;
                if (c == 2) {
                    if (j_current <= j_end) {
                        queue.add("LR");
                        j_current++;
                    }
                    else{ queue.add("LL");j_current--;}
                } else {
                    if (j_current<j_end)
                    {   queue.add("UR");j_current++;}
                    else {queue.add("UL");j_current--;}
                }
            }
            if (Math.abs(j_current-j_end)%2==0){
                while (j_current != j_end){
                    if (j_current<j_end){
                        j_current+=2;
                        queue.add("R");
                    }
                    else {
                        j_current-=2;
                        queue.add("L");
                    }
                }
            }
            else {
                System.out.println("Impossible");
                return;
            }
            System.out.println(queue.size());
            for (String a : queue){
                System.out.print(a+" ");
            }
            System.out.println();
        }
    }

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