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) {
         StringBuilder sb = new StringBuilder();
        int num=0;
        boolean move = true;
        while(move) {
            num++;
            if (i_start - i_end >= 2 && (j_start - j_end >= 1 || (j_start==j_end && j_start>0))) {
                i_start= i_start- 2;
                j_start = j_start - 1;
                sb.append("UL ");
            } else if (i_start - i_end >= 2 && (j_start - j_end <= -1|| (j_start==j_end && j_start<n-1))) {
                i_start = i_start - 2;
                j_start = j_start + 1;
                sb.append("UR ");
            } else if (j_start - j_end <= -2) {
                j_start = j_start + 2;
                sb.append("R ");
            } else if (i_start - i_end <= -2 && (j_start - j_end <= -1 || (j_start==j_end && j_start<n-1))) {
                i_start = i_start + 2;
                j_start = j_start + 1;
                sb.append("LR ");
            } else if (i_start - i_end <= -2 && (j_start - j_end >= 1 || (j_start==j_end && j_start>0))) {
                i_start = i_start + 2;
                j_start = j_start - 1;
                sb.append("LL ");
            } else if (j_start - j_end >= 2) {
                j_start = j_start - 2;
                sb.append("L ");
            }
            else{
                num--;
                move = false;
                if(i_end!=i_start || j_end!=j_start){
                    System.out.println("Impossible");
                }else{
                    System.out.println(num);
                    System.out.println(sb);
                }
            }
        }
    }

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