"""simple docstring"""


from __future__ import annotations






def      __UpperCAmelCase       (      lowercase ,lowercase		):







  """simple docstring"""
  _UpperCAmelCase    			=   sorted(numsa + numsa		)
  _UpperCAmelCase			,					_UpperCAmelCase    			=   divmod(len(lowercase		) ,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__			=    [float(x) for x in input("""Enter the elements of first array: """).split()]
    UpperCAmelCase__			=    [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"""


from math import isqrt






def      __UpperCAmelCase       (      lowercase		):







  """simple docstring"""
  _UpperCAmelCase    			=   [True] * max_number
  for i in range(2 ,isqrt(max_number - 1		) + 1		):
    if is_prime[i]:
      for j in range(i**2 ,lowercase ,lowercase		):
        _UpperCAmelCase    			=   False

  return [i for i in range(2 ,lowercase		) if is_prime[i]]






def      __UpperCAmelCase       (      lowercase = 10**8		):







  """simple docstring"""
  _UpperCAmelCase    			=   calculate_prime_numbers(max_number // 2		)

  _UpperCAmelCase    			=   0
  _UpperCAmelCase    			=   0
  _UpperCAmelCase    			=   len(lowercase		) - 1
  while left <= right:
    while prime_numbers[left] * prime_numbers[right] >= max_number:
      right -= 1
    semiprimes_count += right - left + 1
    left += 1

  return semiprimes_count


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