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) {
        int absX = Math.abs(i_start-i_end);
        int absY = Math.abs(j_start-j_end);
        int x = i_start;
        int y = j_start;
        int temp = i_end;
        i_end= j_end;
        j_end = temp;
        int count =0;
        String result = "";
        //if absX||absY decreases choose the move
        while((x>-1 && x<n) && (y>-1 && y<n)){
            count++;
            //System.out.println(result);
            //move uppper left
                //if(isValid(y-2,x-1,n)){
                //System.out.println("x ="+x+"and y="+y);
                if((Math.abs(y-2 -j_end)<=absY && Math.abs(x-1 - i_end)<=absX)&&(isValid(y-2,x-1,n))){
                    //System.out.println("value of y="+y+" absY="+absY+" Math.abs(y-2 -j_end)="+Math.abs(y-2 -j_end));
                    x = x-1;
                    y = y-2; 
                    
                    result = result + "UL ";
                    absX = Math.abs(i_end-x);
                    absY = Math.abs(j_end-y);
                    if(x==i_end && y==j_end)
                        break;
                    
                    
               
            }else if((Math.abs(y-2 -j_end)<=absY && Math.abs(x+1 - i_end)<=absX)&&(isValid(y-2,x+1,n))){
                    //System.out.println('ggjhg');
                    x = x+1;
                    y = y-2; 
                    result = result + "UR ";
                    absX = Math.abs(i_end-x);
                    absY = Math.abs(j_end-y);
                    if(x==i_end && y==j_end)
                        break;
                
            }else if((Math.abs(x+1 - i_end)<=absX)&&(isValid(y,x+1,n))){
                    //System.out.println('ggjhg');
                    x = x+2;
                    y = y; 
                    result = result + "R ";
                    absX = Math.abs(i_end-x);
                    absY = Math.abs(j_end-y);
                    if(x==i_end && y==j_end)
                        break;
                
            }else if((Math.abs(y+2-j_end)<=absY && Math.abs(x+1 - i_end)<=absX)&&(isValid(y+2,x+1,n))){
                    
                    x = x+1;
                    y = y+2; 
                    result = result + "LR ";
                    absX = Math.abs(i_end-x);
                    absY = Math.abs(j_end-y);
                    if(x==i_end && y==j_end)
                        break;
                
            }else if((Math.abs(y+2-j_end)<=absY && Math.abs(x-1 - i_end)<=absX)&&(isValid(y+2,x-1,n))){
                    //System.out.println("value of y="+y+" absY="+absY+" Math.abs(y+2-j_end)="+Math.abs(y+2-j_end));
                    x = x-1;
                    y = y+2; 
                    result = result + "LL ";
                    absX = Math.abs(i_end-x);
                    absY = Math.abs(j_end-y);
                    if(x==i_end && y==j_end)
                        break;
                
            }else if((Math.abs(x-1 - i_end)<=absX)&&(isValid(y,x-1,n))){
                    
                    x = x-2;
                    y = y; 
                    result = result + "L ";
                    absX = Math.abs(i_end-x);
                    absY = Math.abs(j_end-y);
                    if(x==i_end && y==j_end)
                        break;
               
            }else{
                    count--;
                break;
            }
            
            
        }
        
        if(x==i_end && y==j_end){
            System.out.println(count);
            System.out.println(result.trim());
        }else{
            System.out.println("Impossible");
        }
        
    }
    static Boolean isValid(int x, int y, int n){
        if(x<0 || x>n-1){
            return false;
        }
        if(y<0 || y>n-1){
            return false;
        }
        return true;
    }
    

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