



from __future__ import annotations



def 	UpperCAmelCase   (						_lowerCamelCase ,    _lowerCamelCase    ):
			A							:					Union[str, Any]              =						sorted(numsa + numsa    )
			A							:					List[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()
							__SCREAMING_SNAKE_CASE           =  [float(x) for x in input("""Enter the elements of first array: """).split()]
							__SCREAMING_SNAKE_CASE           =  [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 collections import deque

from .hash_table import HashTable

class 	lowerCamelCase_    ( _A						):






						'''simple docstring'''







						def __init__(	self      :			Union[str, Any]	,	*__lowerCamelCase      :			Dict	,	**__lowerCamelCase      :			int )      ->				Optional[int]:
									super().__init__(*__lowerCamelCase	,	**__lowerCamelCase )







						def 			SCREAMING_SNAKE_CASE__		(	self      :			List[str]	,	__lowerCamelCase      :			List[str]	,	__lowerCamelCase      :			Union[str, Any] )      ->				Union[str, Any]:
									A							:					Optional[Any]              =						deque([] ) if self.values[key] is None else self.values[key]
									self.values[key].appendleft(__lowerCamelCase )
									A							:					Dict              =						self.values[key]







						def 			SCREAMING_SNAKE_CASE__		(	self      :			Any )      ->				str:
									return (
									    sum(self.charge_factor - len(__lowerCamelCase ) for slot in self.values )
									    / self.size_table
									    * self.charge_factor
									)







						def 			SCREAMING_SNAKE_CASE__		(	self      :			Optional[Any]	,	__lowerCamelCase      :			Any	,	__lowerCamelCase      :			List[Any]=None )      ->				Optional[int]:
									if not (
									    len(self.values[key] ) == self.charge_factor and self.values.count(__lowerCamelCase ) == 0
									):
												return key
									return super()._collision_resolution(__lowerCamelCase	,	__lowerCamelCase )