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

public class Solution {

    static int i_redknight;
    static int j_redknight;
    static int counter_redknight;
    static List<String> moves_redknight = new ArrayList<String>();
    
    static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
        i_redknight = i_start;
        j_redknight = j_start;
        counter_redknight = 0;
        
        if (Math.abs(i_end-i_start)%2 == 1) {
            System.out.println("Impossible");
            return;
        }
        
        while (!(i_redknight == i_end && j_redknight == j_end)) {
            moveRedKnight(i_end, j_end);
            //System.out.println(i_redknight + " " + j_redknight);
        }
        
        System.out.println(counter_redknight);
        moves_redknight.forEach(move -> System.out.print(move + " "));
    }
    
    public static void moveRedKnight(int i_end, int j_end) {
        //System.out.println("moveRedKnight: " + i_redknight + " " + j_redknight + " | end: " + i_end+ " " + j_end);
        
        if (i_end - i_redknight < 0 && j_end - j_redknight <= 0) {
            moves_redknight.add("UL");
            //System.out.println("UL");
            i_redknight -= 2;
            j_redknight--;
            counter_redknight++;
        }
        
        else if (i_end - i_redknight < 0 && j_end - j_redknight >= 0) {
            moves_redknight.add("UR");
            //System.out.println("UR");
            i_redknight -= 2;
            j_redknight++;
            counter_redknight++;
        }
        
        else if (i_end == i_redknight && j_redknight - j_end <= 0) {
            moves_redknight.add("R");
            //System.out.println("R");
            j_redknight += 2;
            counter_redknight++;
        }
        
        else if (i_end - i_redknight > 0 && j_end - j_redknight >= 0) {
            moves_redknight.add("LR");
            //System.out.println("LR");
            i_redknight += 2;
            j_redknight++;
            counter_redknight++;
        }
        
        else if (i_end - i_redknight > 0 && j_end - j_redknight <= 0) {
            moves_redknight.add("LL");
            //System.out.println("LL");
            i_redknight += 2;
            j_redknight--;
            counter_redknight++;
        }
        
        else if (i_end == i_redknight && j_redknight - j_end >= 0) {
            moves_redknight.add("L");
            //System.out.println("L");
            j_redknight -= 2;
            counter_redknight++;
        }
    }

    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();
    }
}
//UL, UR, R, LR, LL, L