




from __future__ import annotations




def 		lowerCAmelCase_ (						lowerCamelCase						,  lowerCamelCase ):
				__magic_name__						:						Tuple										=sorted(numsa + numsa )
				__magic_name__					,			__magic_name__						:						Optional[Any]										=divmod(len(lowerCamelCase )						,  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()
							UpperCAmelCase_		:					Union[str, Any]          =  [float(x) for x in input("Enter the elements of first array: ").split()]
							UpperCAmelCase_		:					Dict          =  [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)}""")






'''simple docstring'''





import math







def snake_case_     (					lowercase__		):

  if 1 < number < 4:
    # 2 and 3 are primes
    return True
  elif number < 2 or number % 2 == 0 or number % 3 == 0:
    # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
    return False

  # All primes number are in format of 6k +/- 1
  for i in range(5   ,       int(math.sqrt(lowercase__		) + 1		)   ,       6		):
    if number % i == 0 or number % (i + 2) == 0:
      return False
  return True







def snake_case_     (					lowercase__ = 0.1		):
  UpperCAmelCase__      :					Dict				       =							3
  UpperCAmelCase__      :					Tuple				       =							3

  while primes / (2 * j - 1) >= ratio:
    for i in range(j * j + j + 1   ,       (j + 2) * (j + 2)   ,       j + 1		):
      primes += is_prime(lowercase__		)
    j += 2
  return j


if __name__ == "__main__":
      import doctest

      doctest.testmod()



