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.
        int i_current = i_start;
        int j_current = j_start;
        
        int walkIterations = 0;
        String walkingSequence = "";
        
        while(true) {
            if ((Math.abs(i_current - i_end) == 1)&&(Math.abs(j_current - j_end) == 1)) {
                break;
            }
            
            int i_difference = i_current - i_end;
            int j_difference = j_current - j_end;
            
            
            //System.out.println(i_current + " " + j_current + " " + i_end + " " + j_end);

            if (i_difference > 0) {
                if (j_difference >= 0) {
                    walkingSequence += "UL ";
                    i_current = i_current - 2;
                    j_current = j_current - 1;
                } else {
                    walkingSequence += "UR ";
                    i_current = i_current - 2;
                    j_current = j_current + 1;
                }
            } else if (i_difference == 0) {
                if (j_difference < 0) {
                    walkingSequence += "R ";
                    j_current = j_current + 2;
                } else if (j_difference == 0) {
                    break;
                } else {
                    walkingSequence += "L ";
                    j_current = j_current - 2;
                }
            } else {
                if (j_difference <= 0) {
                    walkingSequence += "LR ";
                    i_current = i_current + 2;
                    j_current = j_current + 1;
                } else {
                    walkingSequence += "LL ";
                    i_current = i_current + 2;
                    j_current = j_current - 1;
                }
            }
            walkIterations++;
            //System.out.println(i_current + " " + j_current);
        }
        
        if((i_current != i_end) && (j_current != j_end)) {
            //System.out.println(i_current + " " + j_current);
            System.out.println("Impossible");
        } else {
            System.out.println(walkIterations);
            System.out.println(walkingSequence);
        }
    }

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