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) {
        if((Math.abs(i_end-i_start)%2!=0)||(Math.abs(i_end-i_start)/2)%2!=Math.abs(j_end-j_start)%2)
        {    System.out.println("Impossible");
        return;}
        int i,j;
        i=j=0;
        i=(Math.abs(i_start-i_end))/2;
        if((j_end>=j_start-i) && (j_end<=j_start+i))
            j=0;
        else
        j=((Math.abs(j_start-j_end))-i)/2;
                    System.out.println(i+j);
    
    if(i_end>i_start)
    {
        int k=0;
        while(k<i)
        {
            if(j_start<j_end)
            {
                j_start++;
                System.out.print("LR ");
            }
            else if(j_start>j_end)
            {
               j_start--;
                System.out.print("LL ");
            }
            else{
                for(int m=0;m<(i-k)/2;m++)
                    System.out.print("LR ");
                for(int m=0;m<(i-k)/2;m++)
                    System.out.print("LL ");
           k=i;
            }
            k++;
        }
        if(j_start<j_end&&j>0){
            for(int m=0;m<j;m++)
                System.out.print("R ");
        }
        else if(j_start>j_end&&j>0){
            for(int m=0;m<j;m++)
                System.out.print("L ");
        }
    }
        else
        {
             int k=0;
        while(k<i)
        {
            if(j_start<j_end)
            {
                j_start++;
                System.out.print("UR ");
            }
            else if(j_start>j_end)
            {
               j_start--;
                System.out.print("UL ");
            }
            else{
                for(int m=0;m<(i-k)/2;m++)
                    System.out.print("UL ");
                for(int m=0;m<(i-k)/2;m++)
                    System.out.print("UR ");
           k=i;
            }
            k++;
        }
        if(j_start<j_end&&j>0){
            for(int m=0;m<j;m++)
                System.out.print("R ");
        }
        else if(j_start>j_end&&j>0){
            for(int m=0;m<j;m++)
                System.out.print("L ");
        }
        }
}
    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();
    }
}