import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class ShortPath {

    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 x1=0,y1=0,x2=n-1,y2=n-1;
    	String UL,UR,R,LR,LL,L;
    	//6 6  0 1
    	// X i = row,Y j= Col
    
    	/*
    	 UL  UR
   
        L      R
       
         LL  LR
    
    	 */
    	//UL L
    	if(i_end < i_start && j_end < j_start){ //2nd Quad
    		int rowDiff = Math.abs(i_end-i_start);
    		int colDiff = Math.abs(j_end-j_start);
    		if(rowDiff%2 != 0){
    			display();
    			return;
    		}else{
    			colDiff = colDiff-(rowDiff/2);
    			if(colDiff < 0){
    				display();
    				return;
    			}else{
    				if(colDiff%2 !=0){
    					display();
    				    return;
    				 }
    			}
    		}
    		System.out.println((rowDiff/2) + (colDiff/2));
    		for(int i=0;i<rowDiff/2;i++){
    			System.out.print("UL ");
    		}
    		for(int i=0;i<colDiff/2;i++){
    			System.out.print("L ");
    		}
    	}
    	//R LR
    	if(i_end > i_start && j_end > j_start){ //4th Quad
    		int rowDiff = Math.abs(i_end-i_start);
    		int colDiff = Math.abs(j_end-j_start);
    		if(rowDiff%2 != 0){
    			display();
    			return;
    		}else{
    			colDiff = colDiff-(rowDiff/2);
    			if(colDiff < 0){
    				display();
    				return;
    			}else{
    				if(colDiff%2 !=0){
    					display();
    				    return;
    				 }
    			}
    		}
    		System.out.println((rowDiff/2) + (colDiff/2));
    		for(int i=0;i<colDiff/2;i++){
    			System.out.print("R ");
    		}
    		for(int i=0;i<rowDiff/2;i++){
    			System.out.print("LR ");
    		}
    		
    	}
    	//UR R 6 1 0 6
    	if(i_end < i_start && j_end > j_start){ //1st Quad
    		int rowDiff = Math.abs(i_end-i_start);
    		int colDiff = Math.abs(j_end-j_start);
    		if(rowDiff%2 != 0){
    			display();
    			return;
    		}else{
    			colDiff = colDiff-(rowDiff/2);
    			if(colDiff < 0){
    				display();
    				return;
    			}else{
    				if(colDiff%2 !=0){
    					display();
    				    return;
    				 }
    			}
    		}
    		System.out.println((rowDiff/2) + (colDiff/2));
    		for(int i=0;i<rowDiff/2;i++){
    			System.out.print("UR ");
    		}
    		for(int i=0;i<colDiff/2;i++){
    			System.out.print("R ");
    		}
    		
    		
    	}
    	//LL L
        if(i_end > i_start && j_end < j_start){ //3st Quad
        	int rowDiff = Math.abs(i_end-i_start);
    		int colDiff = Math.abs(j_end-j_start);
    		if(rowDiff%2 != 0){
    			display();
    			return;
    		}else{
    			colDiff = colDiff-(rowDiff/2);
    			if(colDiff < 0){
    				display();
    				return;
    			}else{
    				if(colDiff%2 !=0){
    					display();
    				    return;
    				 }
    			}
    		}
    		System.out.println((rowDiff/2) + (colDiff/2));
    		for(int i=0;i<rowDiff/2;i++){
    			System.out.print("LL ");
    		}
    		for(int i=0;i<colDiff/2;i++){
    			System.out.print("L ");
    		}
    		
    	}
        
        //Rest one same line UP DOWN LEFT RIGHT
    	
    	
    }

	private static void display() {
		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();
    }
}