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.
        if (((i_start%2)!=(i_end%2)) || ((i_start==i_end) && ((j_start%2)!=(j_end%2))) || (((j_start%2)==(j_end%2)) && (Math.abs(i_start-i_end)%4!=0)) || (((j_start%2)!=(j_end%2)) && (Math.abs(i_start-i_end)%4==0))) {
            System.out.println("Impossible");
        }
        else {
            int cpt = 0;
            String path = "";
            while ((i_start!=i_end) || (j_start!=j_end)) {
                if (i_start==i_end) {
                    if (j_start>j_end) {
                        while (j_start>j_end) {
                            cpt++;
                            path += "L ";
                            j_start -= 2;
                        }
                    }
                    else {
                        while (j_start<j_end) {
                            cpt++;
                            path += "R ";
                            j_start +=2;
                        }
                    }
                }
                else {
                    cpt++;
                    if (i_start<i_end) {
                        if ((j_start<=j_end) || (((j_end-j_start)*2)>(i_end-i_start))) {
                            if (j_end<=j_start+2) {
                                path += "LR ";
                                i_start += 2;
                                j_start++;
                            }
                            else {
                                path += "R ";
                                j_start += 2;
                            }
                        }
                        else {
                            path += "LL ";
                            i_start += 2;
                            j_start--;
                        }
                    }
                    else {
                        if ((j_start<j_end) && (((j_end-j_start)*2)>=(i_start-i_end))) {
                            path += "UR ";
                            i_start -= 2;
                            j_start++;
                        }
                        else {
                            path += "UL ";
                            i_start -= 2;
                            j_start--;
                        }
                    }
                }
            }
            System.out.println(cpt);
            System.out.println(path);
        }
    }

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