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 counter = 0;
        int height_diff = i_start - i_end;
        int width_diff = j_start - j_end;
        int direction  = height_diff * width_diff;
        
        int h2 = height_diff/2;
        int absh = Math.abs(height_diff);
        int absw = Math.abs(width_diff);
        int w2 = (absw-(absh/2))%2;
        int w = (absw-(absh/2))/2;
        if((w2!=0)||(height_diff%2 != 0)){
            System.out.println("Impossible");
        }
        else{
            counter = h2 + w;
            
        if(direction > 0){
            if(height_diff > 0){
                System.out.println(counter);
                for (int i=0; i<h2; i++){
                   System.out.print("UL ");
                }
                for(int j=0; j<w; j++){
                    System.out.print("L ");
                }
                
            }
            else {
                System.out.println(counter);
                 for (int i=0; i<h2; i++){
                   System.out.print("LR ");
                }
                for(int j=0; j<w; j++){
                    System.out.print("R ");
                } 
            }
        }
        else if(direction < 0){
            System.out.println(counter);
             if(height_diff > 0){
                 for (int i=0; i<h2; i++){
                   System.out.print("UR ");
                }
                for(int j=0; j<w; j++){
                    System.out.print("R ");
                }
            }
            else {
                
                System.out.println(counter);
                 for (int i=0; i< absh/2; i++){
                   System.out.print("LL ");
                }
                for(int j=0; j<w; j++){
                    System.out.print("L ");
                }
            }
        }
        else if(direction == 0){
            int k = Math.abs(height_diff);
            if(height_diff > 0){
                
                System.out.println(k/2);
                for (int i=0; i<k; i = i+4){
                   System.out.print("UL UR ");
                }
            }
            else if(height_diff < 0){
                System.out.println(k/2);
                for (int i=0; i<k; i = i+4){
                   System.out.print("LR LL ");
                }
            }
            else{
                int k1 = Math.abs(width_diff);
               if(width_diff > 0){
                   System.out.println(k1/2);
                for(int j=0; j<k1; j = j+2){
                    System.out.print("L ");
                }
            }
                else if(width_diff < 0){
                    System.out.println(k1/2);
                    for(int j=0; j<k1; j = j+2){
                    System.out.print("R ");
                }
                }
            }
        }
        }
        
     
    }

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