




def        _SCREAMING_SNAKE_CASE      (		snake_case			,     snake_case       )						->				int:
						while a != 0:
												_UpperCAmelCase    ,					_UpperCAmelCase      =			b % a, a
						return b




def        _SCREAMING_SNAKE_CASE      (		snake_case			,     snake_case       )						->				int:
						if gcd(snake_case			,     snake_case       ) != 1:
												_UpperCAmelCase      =			f"mod inverse of {a!r} and {m!r} does not exist"
												raise ValueError(snake_case       )
						_UpperCAmelCase    ,					_UpperCAmelCase    ,					_UpperCAmelCase      =			1, 0, a
						_UpperCAmelCase    ,					_UpperCAmelCase    ,					_UpperCAmelCase      =			0, 1, m
						while va != 0:
												_UpperCAmelCase      =			ua // va
												_UpperCAmelCase    ,					_UpperCAmelCase    ,					_UpperCAmelCase    ,					_UpperCAmelCase    ,					_UpperCAmelCase    ,					_UpperCAmelCase      =			(ua - q * va), (ua - q * va), (ua - q * va), va, va, va
						return ua % m





from __future__ import annotations




def        _SCREAMING_SNAKE_CASE      (		snake_case			,     snake_case       )						->				float:
						_UpperCAmelCase      =			sorted(numsa + numsa       )
						_UpperCAmelCase    ,					_UpperCAmelCase      =			divmod(len(snake_case       )			,     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													=			[float(x) for x in input("Enter the elements of first array: ").split()]
				a													=			[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)}')