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

public class Solution {
    static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
    static void printShortestPath(int n, int sRow, int sCol,int endRow, int endCol){
        //  Print the distance along with the sequence of moves.
        //PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
		boolean flag=true;
		String result="";
		int steps=0;
		
		while(flag==true){
            if((Math.abs(sRow-endRow))%2!=0){
				flag=false;
				break;
			}
            if(endRow==sRow-1 || endRow==sRow+1 || (endRow==sRow && (endCol==sCol+1 || endCol==sCol-1))){
				flag=false;
				break;
			}
			if(sRow>endRow){
				if(sCol>=endCol){
					if(sRow-2>=0 && sCol-1>=0){
						result = result+"UL ";
						sRow = sRow-2;
						sCol = sCol-1;
						steps++;
					}
					else{
						flag=false;
						break;
					}	
				}
				else{
					if(sRow-2>=0 && sCol+1<n){
						result = result+"UR ";
						sRow = sRow-2;
						sCol = sCol+1;
						steps++;
					}
					else{
						flag=false;
						break;
					}
				}
			}
			else if(sRow==endRow){
				if(sCol>endCol){
					if(sCol-2>=0){
						result=result+"L ";
						steps++;
						sCol=sCol-2;
					}
					else{
						flag=false;
						break;
					}
				}
				else if(sCol==endCol)
					break;
				else{
					if(sCol+2<n){
						result=result+"R ";
						sCol=sCol+2;
						steps++;
					}
					else{
						flag=false;
						break;
					}
				}
			}
			else{
				if(sCol>endCol){
					if(sRow+2<n && sCol-1>=0){
						result = result+"LL ";
						sRow = sRow+2;
						sCol = sCol-1;
						steps++;
					}
					else{
						flag=false;
						break;
					}	
				}
				else{
					if(sRow+2<n && sCol+1<n){
						result = result+"LR ";
						sRow = sRow+2;
						sCol = sCol+1;
						steps++;
					}
					else{
						flag=false;
						break;
					}
				}
			}
		}
		
		if(flag==false)
			pw.println("Impossible");
		else
			pw.println(steps+"\n"+result);
		pw.close();
    }

    public static void main(String[] args) throws IOException{
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
       // PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
        int n = Integer.parseInt(bf.readLine());
        String input[] = bf.readLine().split(" ");
        int i_start = Integer.parseInt(input[0]);
        int j_start = Integer.parseInt(input[1]);
        int i_end = Integer.parseInt(input[2]);
        int j_end = Integer.parseInt(input[3]);
        printShortestPath(n, i_start, j_start, i_end, j_end);
        bf.close();
        //pw.close();
    }
}