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 sum =0;
        String put ="";
        if((Math.abs(i_start)-Math.abs(i_end))%2==0){
            do{
            if(i_start>i_end){
                if(j_start>j_end){
                    i_start-=2;
                    j_start--;
                    sum++;
                    put +="UL ";
                    
                }else if(j_start<j_end){
                    i_start-=2;
                    j_start++;
                    sum++;
                    put +="UR ";
                }else if(j_start==j_end && (i_start-i_end>3)){
                    i_start-=2;
                    j_start--;
                    sum++;
                    put +="UL ";
                }else{
                    i_start-=2;
                    sum++;
                    put +="U ";
                }
            }else if(i_start<i_end){
                if(j_start<j_end){
                    i_start+=2;
                    j_start++;
                    sum++;
                    put +="LR ";
                    
                }else if(j_start>j_end){
                    i_start+=2;
                    j_start--;
                    sum++;
                    put +="LL ";
                }else if(j_start==j_end && (i_end-i_start>3)){
                    i_start+=2;
                    j_start++;
                    sum++;
                    put +="LR ";
                }else{
                    j_start+=2;
                    sum++;
                    put +="L ";
                }
            }else{
                if(j_start>j_end){
                    j_start-=2;
                    sum++;
                    put +="L ";
                }else if(j_start<j_end){
                    j_start++;
                    sum++;
                    put +="R ";
                }
            }
            }while(i_start!=i_end || j_start!=j_end);
                    System.out.println(sum+"\n"+put);
                
        }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();
    }
}