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 updown_movs = 0;
        int rightleft_movs = 0;
        int curr_y = j_start, curr_x = i_start;
        int i;
        
        if((i_start-i_end)%2==1)
            System.out.println("Impossible");
        else {
            updown_movs = Math.abs((i_start-i_end)/2);
            if(Math.abs(j_end-j_start)>=updown_movs) {
                if(j_end<j_start) {
                    curr_y = j_start-updown_movs;
                    if((curr_y-j_end)%2==1) {
                        System.out.println("Impossible");
                        return;
                    }
                    else {
                        rightleft_movs = (curr_y-j_end)/2;
                        System.out.println(rightleft_movs+updown_movs);
                        if(i_start>i_end) {
                            for(i=0;i<updown_movs;i++)
                                System.out.print("UL ");
                            for(i=0;i<rightleft_movs;i++)
                                System.out.print("L ");
                        }
                        else {
                            for(i=0;i<updown_movs;i++)
                                System.out.print("LR "); 
                            for(i=0;i<rightleft_movs;i++)
                                System.out.print("L ");               
                        }
                    }
                }
                else {
                    curr_y = j_start+updown_movs;
                    if((curr_y-j_end)%2==1) {
                        System.out.println("Impossible");
                        return;
                    }
                    else {
                        rightleft_movs = (j_end-curr_y)/2;
                        System.out.println(rightleft_movs+updown_movs);
                        if(i_start>i_end) {
                            for(i=0;i<updown_movs;i++)
                                System.out.print("UR ");
                            for(i=0;i<rightleft_movs;i++)
                                System.out.print("R ");
                        }
                        else {
                            for(i=0;i<rightleft_movs;i++)
                                System.out.print("R ");
                            for(i=0;i<updown_movs;i++)
                                System.out.print("LR ");                
                        }
                    }
                }
            }
            else {
                int updown_zigzag = 0;
                updown_movs = Math.abs(j_start-j_end);
                curr_y = j_end;
                
                if(i_start>i_end)
                    curr_x -= 2*updown_movs;
                else if(i_start<i_end)
                    curr_x += 2*updown_movs;

                if((curr_x-i_end)%4!=0) {
                    System.out.println("Impossible");
                    return;
                }
                else {
                    updown_zigzag=Math.abs(curr_x-i_end)/2;
                    System.out.println(updown_movs+updown_zigzag);
                }
                if(i_start>i_end) {
                    if(j_start>j_end) {
                        for(i=0;i<updown_movs;i++) {
                            System.out.print("UL ");
                        }
                    }
                    else if(j_start<j_end){
                        for(i=0;i<updown_movs;i++) {
                            System.out.print("UR ");
                        }
                    }
                    if(j_end!=0) {
                        for(i = 0;i<updown_zigzag/2;i++) {
                            System.out.print("UL UR ");
                        }
                    }
                    else {
                        for(i = 0;i<updown_zigzag/2;i++) {
                            System.out.print("UR UL ");
                        }
                    }                    
                }
                else if(i_start<i_end) {
                    if(j_end!=n-1) {
                        for(i = 0;i<updown_zigzag/2;i++) {
                            System.out.print("LR LL ");
                        }
                    }
                    else {
                        for(i = 0;i<updown_zigzag/2;i++) {
                            System.out.print("LL LR ");
                        }
                    }
                    if(j_start>j_end) {
                        for(i=0;i<updown_movs;i++) {
                            System.out.print("LL ");
                        }
                    }
                    else if(j_start<j_end) {
                        for(i=0;i<updown_movs;i++) {
                            System.out.print("LR ");
                        }
                    }
                    
                }
            }
        }
    }

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