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) {
        //  Print the distance along with the sequence of moves.
        int i=i_start;
        int j=j_start;
        int count=0;
        int[] seq=new int[100];
        if((i_end-i_start)%2==0){
   
            while(i_end>i){
                if(j_end>=j){
                    i=i+2;
                    j=j+1;
                    count++;
                    seq[count]=4;
                    continue;
                }if(j_end<j){
                    i+=2;
                    j-=1;
                    count++;
                    seq[count]=5;
                    continue;
                }
                
                
            }while(i_end<i){
                if(j_end>j){
                    i=i-2;
                    j=j+1;
                    count++;
                    seq[count]=2;
                    continue;
                }if(j_end<=j){
                    i-=2;
                    j-=1;
                    count++;
                    seq[count]=1;
                    continue;
                    
                }
            }while(i_end==i){
                if(j_end>j && j_end>j_start){
                    j=j+2;
                    count++;
                    seq[count]=3;
                    continue;
                    }
                if(j_end<j && j_end<j_start){
                    j-=2;
                    count++;
                    seq[count]=6;
                    continue;
                }
                int temp;
                String[] arr=new String[100];
                
                
                if(j_end==j){
                    
                    for(int k=1;k<count;k++){
                        for(int l=k+1;l<=count;l++){
                            if(seq[l]<seq[k]){
                                temp=seq[k];
                                seq[k]=seq[l];
                                seq[l]=temp;
                   //     System.out.println("paras");
             
                            }
                            
                        }
                        
                    }
                    for(int k=1;k<=count;k++){
                        if(seq[k]==1)
                            arr[k]="UL";
                        if(seq[k]==2)
                            arr[k]="UR";
                        if(seq[k]==3)
                            arr[k]="R";
                        if(seq[k]==4)
                            arr[k]="LR";
                        if(seq[k]==5)
                            arr[k]="LL";
                        if(seq[k]==6)
                            arr[k]="L";
                    
                            
                    }
                    
                    
                    
                    System.out.println(count);
                    for(int k=1;k<count;k++){
                        System.out.print(arr[k]+" ");
                    }
                    System.out.println(arr[count]);
                    break;
                    
                    
                }
                else{
                    System.out.println("Impossible");
                    break;
                }
            }   
        }
        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();
    }
}