






from __future__ import annotations







def 	_UpperCamelCase       (    UpperCamelCase_       :					list[float]    ,       UpperCamelCase_       :					list[float]		)  ->   float:

						"""simple docstring"""



						lowerCAmelCase__    						=						sorted(numsa + numsa		)
						lowerCAmelCase__						,       lowerCAmelCase__    						=						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()
					__snake_case    :    List[str]         =     [float(x) for x in input("""Enter the elements of first array: """).split()]
					__snake_case    :    str         =     [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

from functools import lru_cache
from math import ceil

__snake_case    :    Union[str, Any]         =     1_00

__snake_case    :    Tuple         =     set(range(3, NUM_PRIMES, 2))
primes.add(2)
__snake_case    :    int

for prime in range(3, ceil(NUM_PRIMES**0.5), 2):
					if prime not in primes:
										continue
					primes.difference_update(set(range(prime * prime, NUM_PRIMES, prime)))







@lru_cache(maxsize=100		)
def 	_UpperCamelCase   (    UpperCamelCase_       :					int		)  ->   set[int]:

						"""simple docstring"""



						if number_to_partition < 0:
												return set()
						elif number_to_partition == 0:
												return {1}

						lowerCAmelCase__    						=						set()
						lowerCAmelCase__    						=						42
						lowerCAmelCase__    						=						42

						for prime in primes:
												if prime > number_to_partition:
																		continue
												for sub in partition(number_to_partition - prime		):
																		ret.add(sub * prime		)

						return ret







def 	_UpperCamelCase   (    UpperCamelCase_       :					int = 5000		)  ->   int | None:

						"""simple docstring"""



						for number_to_partition in range(1    ,       UpperCamelCase_		):
												if len(partition(UpperCamelCase_		)		) > number_unique_partitions:
																		return number_to_partition
						return None


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





