





from math import isqrt

def      UpperCAmelCase_    (    _UpperCAmelCase							:int				)	->				bool:
     '''simple docstring'''


     return all(number % divisor != 0 for divisor in range(2  ,						isqrt(_UpperCAmelCase				) + 1				)				)

def      UpperCAmelCase_    (    _UpperCAmelCase							:int = 10**6				)	->				int:
     '''simple docstring'''


     A_          =       0
     A_          =       1
     A_          =       7
     while prime_candidate < max_prime:
          primes_count += is_prime(_UpperCAmelCase				)

          cube_index += 1
          prime_candidate += 6 * cube_index

     return primes_count


if __name__ == "__main__":
      print(f'''{solution() = }''')










from __future__ import annotations

def      UpperCAmelCase_    (    _UpperCAmelCase							:list[float]  ,						_UpperCAmelCase							:list[float]				)	->				float:
     '''simple docstring'''


     A_          =       sorted(numsa + numsa				)
     A_   ,    A_          =       divmod(len(_UpperCAmelCase				)  ,						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()
      a__      :     Optional[Any]         =		[float(x) for x in input('Enter the elements of first array: ').split()]
      a__      :     int         =		[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)}''')



