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 cur_i=i_start;
        int cur_j=j_start;
        String result="";
        int count=0;
        if(Math.abs(i_start-i_end)%2==0){
            while(cur_i!=i_end||cur_j!=j_end){
                if(cur_i==i_end&&(cur_j!=j_end)){
                    if(cur_j<j_end){
                        result=result+"R ";
                        cur_j=cur_j+2;
                        count=count-1;
                    }
                    else{
                        result=result+"L ";
                        cur_j=cur_j-2;
                        count=count+1;
                    }
                }
                else{
                    if(cur_i>i_end){
                        if(cur_j>=j_end){
                            result=result+"UL ";
                            cur_i=cur_i-2;
                            cur_j=cur_j-1;
                            count=count+1;
                        }

                        else{
                            result= result+"UR ";
                            cur_i=cur_i-2;
                            cur_j=cur_j+1;
                            count=count+1;
                        }
                    }
                    else if(cur_i<i_end){
                        if(cur_j<=j_end){
                            result=result+"LR ";
                            cur_i=cur_i+2;
                            cur_j=cur_j+1;
                            count=count+1;
                        }
                        else{
                            result=result+"LL ";
                            cur_i=cur_i+2;
                            cur_j=cur_j-1;
                            count=count+1;
                        }
                    }
                    
            }
        }   
             System.out.println(count+"\n"+result);

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