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.
        // i for row
        int row = Math.abs(i_end - i_start), column = Math.abs(Math.abs(j_end - - row/2) - j_start) ;
        if (row % 2 == 1 || column % 2 == 1) {
            System.out.println("Impossible");
            return;
        }
        int count = 0;
        //System.out.println(j_end > j_start);
        while (j_start != j_end || i_start != i_end){
            
            if (i_end < i_start && j_end <= j_start) {
                System.out.print("UL ");
                i_start -= 2;
                j_start -= 1;
                continue;
            } else if (i_end < i_start && j_end > j_start) {
                System.out.print("UR ");
                i_start -= 2;
                j_start++;
                continue;
            } else if (i_end == i_start && j_end > j_start) {
                System.out.print("R ");
                j_start += 2;
                continue;
            } else if (i_end > i_start && j_end >= j_start) {
                System.out.print("LR ");
                i_start += 2;
                j_start++;
                continue;
            } else if (i_end > i_start && j_end < j_start) {
                System.out.print("LL ");
                i_start += 2;
                j_start--;
                continue;
            } else if (i_end == i_start && j_end < j_start) {
                System.out.print("L ");
                j_start -= 2;
                continue;
            }
            if (count > 10) {
                System.out.print("Oops!");
                break;
            }
        } 
    }

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