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

public class ShortPath {
	public static boolean isNegative(int i_start,int j_start) {
		return (i_start<0||j_start<0);
	}
	public static void UL(int i_start,int j_start) {
		if(isNegative(i_start, j_start)) {
			return ;
		}
		
	}
	public static void UR(int i_start,int j_start) {
		
		i_start-=2;
		j_start+=1;
	}
	public static void R(int i_start,int j_start) {
		j_start+=2;
	}
	public static void LR(int i_start,int j_start) {
		i_start+=2;
		j_start+=1;
	}
	public static void LL(int i_start,int j_start) {
		
	}
	public static void L(int i_start,int j_start) {
		
	}
    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(i_start==i_end&&j_start==j_end) {
    		System.out.println(0);
    		return ;
    	}
    	boolean isExistPath=true;
    	String str="";
    	int sum=0;
    	while(i_start!=i_end||j_start!=j_end) {
    		if(i_start+1==i_end&&j_start==j_end ||
    		   i_start-1==i_end&&j_start==j_end ||
    		   i_start==i_end&&j_start-1==j_end ||
    		   i_start==i_end&&j_start+1==j_end ||
    		   i_start-1==i_end&&j_start-1==j_end ||
    		   i_start-1==i_end&&j_start+1==j_end ||
    		   i_start+1==i_end&&j_start-1==j_end ||
    		   i_start+1==i_end&&j_start+1==j_end ) {
    			isExistPath=false;
    			break;
    		}
    		if(i_start>i_end&&j_start>j_end) {
    			if(i_start<=1) {
    				j_start-=2;
    				str+="L ";
    				sum++;
    				//path.add("L");
    			}
    			else {
    				i_start-=2;
        			j_start-=1;
        			str+="UL ";
        			sum++;
        			//path.add("UL");
    			}
    			
    		}
    		else if(i_start==i_end&&j_start>j_end) {
    			j_start-=2;
    			str+="L ";
    			sum++;
    			//path.add("L");
    		}
    		else if(i_start<i_end&&j_start>j_end) {
    			if(i_start>=n-2) {
    				j_start-=2;
    				str+="L ";
    				sum++;
    				//path.add("L");
    			}
    			else {
    				i_start+=2;
        			j_start--;
        			str+="LL ";
        			sum++;
        			//path.add("LL");
    			}
    		}
    		else if(i_start>i_end&&j_start==j_end ) {
    			if(i_start>0) {
    				i_start-=2;
        			j_start-=1;
        			str+="UL ";
        			sum++;
        			//path.add("UL");
    			}
    			else {
    				i_start-=2;
    				j_start+=1;
    				str+="UR ";
    				sum++;
    				//path.add("UR");
    				}
    		}
    		else if(i_start<i_end&&j_start==j_end) {
    			if(j_start<n-1) {
    				i_start+=2;
    				j_start+=1;
    				str+="LR ";
    				sum++;
        			//path.add("LR");
    			}
    			else {
    				i_start+=2;
        			j_start--;
        			str+="LL ";
        			sum++;
    				//path.add("LL");
    			}
    			
    		}
    		else if(i_start>i_end&&j_start<j_end) {
    			if(i_start<=1) {
    				j_start+=2;
    				str+="R ";
    				sum++;
    				//path.add("R");
    			}
    			else {
    				i_start-=2;
    				j_start+=1;
    				str+="UR ";
    				sum++;
            		//path.add("UR");
    			}
    		}
    		else if(i_start==i_end&&j_start<j_end) {
    			j_start+=2;
    			str+="R ";
    			sum++;
    			//path.add("R");
    		}
    		else if(i_start<i_end&&j_start<j_end) {
    			if(i_start>=n-2) {
    				j_start+=2;
    				str+="R ";
    				sum++;
    				//path.add("R");
    			}
    			else {
    				i_start+=2;
    				j_start+=1;
    				str+="LR ";
    				sum++;
        			//path.add("LR");
    			}
    		}
    		else {
    			break;
    		}
    	}
    	if(!isExistPath) {
    		System.out.println("Impossible");
    		return ;
    	}
    	System.out.println(sum);
    	System.out.println(str);
    }

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