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.
        if(((i_start-i_end)%2 != 0)||((i_start-i_end)%4 == 0 && (j_start-j_end)%2 != 0) || ((i_start-i_end)%4 != 0 && (j_start-j_end)%2 == 0)){
            System.out.print("Impossible");
            return;
        }
        
        int vSteps = Math.abs(i_start-i_end)/2;
        int hSteps = Math.abs(j_start-j_end)>vSteps?(Math.abs(j_start-j_end)-vSteps)/2:0;
        System.out.println(vSteps + hSteps);
        
        if(i_start==i_end){//go same level
            if(j_start>j_end){//go left
                for(int i = 0; i<hSteps; i++)
                        System.out.print("L ");
            }
            else{
                for(int i = 0; i<hSteps; i++)
                        System.out.print("R ");
            }
        }
        else if(i_start>i_end){//go up
            if(j_start>j_end){//go left
                if(hSteps!=0){
                    for(int i = 0; i<vSteps; i++)
                        System.out.print("UL ");
                    for(int i = 0; i<hSteps; i++)
                        System.out.print("L ");
                }
                else{
                    for(int i = 0; i<(j_start-j_end + vSteps)/2; i++)
                        System.out.print("UL ");
                    for(int i = 0; i<(vSteps - (j_start-j_end))/2; i++)
                        System.out.print("UR ");
                }
            }
            else{//go right or same
                if(hSteps!=0){
                    for(int i = 0; i<vSteps; i++)
                        System.out.print("UR ");
                    for(int i = 0; i<hSteps; i++)
                        System.out.print("R ");
                }
                else{
                    for(int i = 0; i<(j_start-j_end + vSteps)/2; i++)
                        System.out.print("UL ");
                    for(int i = 0; i<(vSteps - (j_start-j_end))/2; i++)
                        System.out.print("UR ");
                }
            }
        }
        else{//go down 
            if(j_start>j_end){//go left
                if(hSteps!=0){
                    for(int i = 0; i<vSteps; i++)
                        System.out.print("LL ");
                    for(int i = 0; i<hSteps; i++)
                        System.out.print("L ");
                }
                else{
                    for(int i = 0; i<(vSteps - (j_start-j_end))/2; i++)
                        System.out.print("LR ");
                    for(int i = 0; i<(j_start-j_end + vSteps)/2; i++)
                        System.out.print("LL ");
                }
            }
            else{//go right or same
                if(hSteps!=0){
                    for(int i = 0; i<hSteps; i++)
                        System.out.print("R ");
                    for(int i = 0; i<vSteps; i++)
                        System.out.print("LR ");
                }
                else{
                    for(int i = 0; i<(vSteps - (j_start-j_end))/2; i++)
                        System.out.print("LR ");
                    for(int i = 0; i<(j_start-j_end + vSteps)/2; i++)
                        System.out.print("LL ");
                }
            }
        }
    }

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