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(Math.abs(i_start-i_end)%3==0 &&(Math.abs(j_start-j_end)%2!=0|| j_start==j_end)){
            int ii= Math.abs(i_start-i_end)/2;
            int jj=Math.abs((j_start-j_end)-ii)/2;
            System.out.println(ii+jj);
            for(int i=0;i<ii;i++){
                if(i_start<i_end){
                    if(j_start<j_end){
                        System.out.print("LR ");
                    }else{
                         System.out.print("LL ");
                    }
                }else{
                   if(j_start<j_end){
                        System.out.print("UR ");
                    }else{
                         System.out.print("UL ");
                    }
                }
            }
            for(int i=0;i<jj;i++){
                if(j_start<j_end){
                    System.out.print("R ");
                }else{
                    System.out.print("L ");
                }
            }
            
        }else{
            if(Math.abs(i_start-i_end)%2==0 && j_start==j_end){
                int ii= Math.abs(i_start-i_end)/2;
                System.out.println(ii);
                for(int i=0;i<ii;i++){
                    if(i%2==0){
                        if(i_start<i_end){
                            System.out.print("LR ");
                        }else{
                            System.out.print("UR ");
                        }
                    }else{
                        if(i_start<i_end){
                            System.out.print("LL ");
                        }else{
                            System.out.print("UL ");
                        }
                    }
                }
                
                
            }else{
                System.out.print("Impossible");
            }
            
                
        }
        System.out.print("\n");
    }

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