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 imove = i_end-i_start;  //vertical
        int jmove = j_end - j_start; //horizantal
        //System.out.println("imove : "+ imove);
        //System.out.println("jmove : "+ jmove);
        ArrayList<String> moves = new ArrayList<String>();
        if(imove%2 !=0){
            System.out.println("Impossible");
        }else{
        int lcount = 0;
        if(imove>0){//UL or UR
            int ucount = imove/2;
          //  System.out.println("ucount : "+ ucount);
            while(jmove<ucount-1) {
            	ucount = ucount-2;
            	moves.add("LR");
            	moves.add("LL");
            }
            lcount = (jmove-ucount)/2;
            //System.out.println("lcount : "+ lcount);
            
            if(jmove>0){//left
                
                for (int i=0; i<Math.abs(ucount); i++){
                    //System.out.print("LR ");
                    moves.add("LR");
                }
                
            }else{//right
                for (int i=0; i<Math.abs(ucount); i++){
                   // System.out.print("LL ");
                    moves.add("LL");
                }
            }
            
            
        }else{//LL or LR
            int dcount = imove/2;
            //System.out.println("dcount : "+ dcount);
            while(Math.abs(jmove)<Math.abs(dcount)-1) {
            	dcount = dcount-2;
            	moves.add("UR");
            	moves.add("UL");
            }
            lcount = (jmove-dcount)/2;
            //System.out.println("lcount : "+ lcount);
            if(jmove>0){//left
                
                for (int i=0; i<Math.abs(dcount); i++){
                    moves.add("UR");
                }
                
            }else{//right
                for (int i=0; i<Math.abs(dcount); i++){
                    moves.add("UL");
                }
            }
        }
        if(lcount>0){
                for (int i=0; i<Math.abs(lcount); i++){
                    //System.out.print("L ");
                    moves.add("R");
                }
            }else{
                for (int i=0; i<Math.abs(lcount); i++){
                    //System.out.print("R ");
                    moves.add("L");
                }
            }
        System.out.println(moves.size());
        Collections.sort(moves);
        for(int i = moves.size()-1; i> -1; i--) {
        	System.out.print(moves.get(i) + " ");
        }
        }
    }

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