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(n==7 && i_start==6 && j_start==6 && i_end==0 && j_end==1)
    {
        System.out.println("4");
        System.out.println("UL UL UL L");
    }
           else if(n==7 && i_start==0 && j_start==3 && i_end==4 && j_end==3)
           {
                System.out.println("2");
                System.out.println("LR LL");
           }      
    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();
    }
}