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.
        ArrayList<String> arr = new ArrayList<String>();
        int i = i_start;
        int j = j_start;
        while(true){
            if((j==j_end && i_end>=i-3 && i_end<=i+3) || ((i_end-i)%2!=0) || (i_start>i_end?i<i_end:i>i_end)){
                break;
            }
            int rowDiff = i-i_end;
            int colDiff = j-j_end;
            int row = rowDiff<0 ? -1*rowDiff : rowDiff;
            int col = colDiff<0 ? -1*colDiff : colDiff;
            if((rowDiff>=2) && (i-2>=0 && j-1>=0) && (row/2>col)){
                arr.add("UL");
                i += -2;
                j += -1;
            }else if((rowDiff>=2) && (colDiff<=-1) && (i-2>=0 && j+1<n)){
                arr.add("UR");
                i += -2;
                j += 1;
            }else if((rowDiff==0) && (colDiff<=-2) && (j+2<n)){
                arr.add("R");
                j += 2;
            }else if((rowDiff<=-2) && (i+2<n && j+1<n) && (row/2>col)){
                arr.add("LR");
                i += 2;
                j += 1;
            }else if((rowDiff<=-2) && (colDiff>=1) && (i+2<n && j-1>=0)){
                arr.add("LL");
                i += 2;
                j += -1;
            }else if((rowDiff==0) && (colDiff>=2) && (j-2>=0)){
                arr.add("L");
                j += -2;
            }
        }
        if(i==i_end && j==j_end){
            System.out.println(arr.size());
            for(int l=0;l<arr.size();l++){
                System.out.print(arr.get(l)+" ");
            }
        }else{
            System.out.println("Impossible");
        }
    }

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