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

public class Solution {
    
    static int match_count = 0;
	static String path = "";

    static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
        
        
		if(5<= n && n <= 200 && i_start >= 0 && j_start >= 0 && i_end >= 0 && j_end >= 0){
			
			if(i_end < i_start){
	        	if(j_end < j_start){
	        		path = path + "UL ";
	        		i_start = i_start - 2;
	        		j_start = j_start - 1;
	        		match_count++;
	        		printShortestPath(n, i_start, j_start, i_end, j_end);
	        	}else if(j_start < j_end){
	        		path = path + "UR ";
	        		i_start = i_start - 2;
	        		j_start = j_start + 1;
	        		match_count++;
	        		printShortestPath(n, i_start, j_start, i_end, j_end);
	        	}else{
	        		if(i_start - i_end == 4){
	        			System.out.println("2");
		        		System.out.println("UR UL");
	        		}else if(i_start - i_end == 2){
	        			System.out.println("2");
		        		System.out.println("UR L");
	        		}else{
		        		System.out.println("Impossible");
	        		}
	        	}
	        }else if(i_start < i_end){
	        	if(j_end < j_start){
	        		path = path + "LL ";
	        		i_start = i_start + 2;
	        		j_start = j_start - 1;
	        		match_count++;
	        		printShortestPath(n, i_start, j_start, i_end, j_end);
	        	}else if(j_start < j_end){
	        		path = path + "LR ";
	        		i_start = i_start + 2;
	        		j_start = j_start + 1;
	        		match_count++;
	        		printShortestPath(n, i_start, j_start, i_end, j_end);
	        	}else{
	        		if(i_end - i_start == 4){
	        			System.out.println("2");
		        		System.out.println("LR LL");
	        		}else if(i_end - i_start == 2){
	        			System.out.println("2");
		        		System.out.println("LR LL");
	        		}else{
		        		System.out.println("Impossible");
	        		}
	        		
	        	}
	        }else if(i_start == i_end){
	        	if(j_end < j_start){
	        		path = path + "L ";
	        		j_start = j_start - 2;
	        		match_count++;
	        		printShortestPath(n, i_start, j_start, i_end, j_end);
	        	}else if(j_start < j_end){
	        		path = path + "R ";
	        		j_start = j_start + 2;
	        		match_count++;
	        		printShortestPath(n, i_start, j_start, i_end, j_end);
	        	}else{
	        		System.out.println(match_count);
	        		System.out.println(path);
	        		
	        	}
	        }
			
		}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();
    }
}