

from __future__ import annotations
def 	a (     A__      :  list[float] ,  A__      :  list[float]	)       -> float:





      """simple docstring"""



      _lowercase      			=sorted(numsa + numsa	)
      _lowercase			,			_lowercase      			=divmod(len(A__	) ,  2	)
      if mod == 1:
            return all_numbers[div]
      else:
            return (all_numbers[div] + all_numbers[div - 1]) / 2


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  lowercase_   							=  [float(x) for x in input('Enter the elements of first array: ').split()]
  lowercase_   							=  [float(x) for x in input('Enter the elements of second array: ').split()]
  print(f"The median of two arrays is: {median_of_two_arrays(array_a, array_a)}")






from __future__ import annotations






def 					UpperCamelCase   (      __magic_name__	:				list[int]	)  ->    list[int]:  # This function is recursive
		"""simple docstring"""




		lowercase__	     =						len(__magic_name__	)
		# If the array contains only one element, we return it (it's the stop condition of
		# recursion)
		if array_length <= 1:
				return array
				# Else
		lowercase__	     =						array[0]
		lowercase__	     =						False
		lowercase__	     =						1
		lowercase__	     =						[]
		while not is_found and i < array_length:
				if array[i] < pivot:
						lowercase__	     =						True
						lowercase__	     =						[element for element in array[i:] if element >= array[i]]
						lowercase__	     =						longest_subsequence(__magic_name__	)
						if len(__magic_name__	) > len(__magic_name__	):
								lowercase__	     =						temp_array
				else:
						i += 1

		lowercase__	     =						[element for element in array[1:] if element >= pivot]
		lowercase__	     =						[pivot, *longest_subsequence(__magic_name__	)]
		if len(__magic_name__	) > len(__magic_name__	):
				return temp_array
		else:
				return longest_subseq


if __name__ == "__main__":
	import doctest

	doctest.testmod()

