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.
        //System.out.print("FAG");
        int mvCount=0;
        String moves = "";
        int height_dif=Math.abs(i_start-i_end);
        int len_dif=Math.abs(j_start-j_end);
        if(height_dif%2==0){
            if((len_dif-(height_dif/2))%2==0)
                while (i_start!=i_end){
                    mvCount++;
                    if(i_start>i_end){
                        if(j_start>j_end || j_start==j_end){
                           //LL
                           moves+="UL ";
                           j_start--;
                           i_start-=2;
                        }
                        else if(j_start<j_end){
                            //LR
                            moves+="UR ";
                            j_start++;
                            i_start-=2;
                        }
                    }
                    else if(i_start<i_end){
                        if(j_start<j_end || j_start==j_end){
                           //UL 
                            moves+="LR ";
                            j_start++;
                            i_start+=2;
                        }
                        else if(j_start>j_end){
                            //UR
                            moves+="LL ";
                            j_start--;
                            i_start+=2;
                        }
                    }
                }
            while(j_start!=j_end){
                mvCount++;
                if(j_start>j_end)
                {
                    //L
                    moves+="L ";
                    j_start-=2;
                }
                else if(j_start<j_end)
                {
                    //R
                    moves+="R ";
                    j_start+=2;
                }
            }
        System.out.println(mvCount);
        System.out.println(moves.trim());     
        }
        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();
    }
}