




from __future__ import annotations





def 		__A		(	__lowerCamelCase							,			__lowerCamelCase    )      ->       bool:
	if len(__lowerCamelCase    ) == 0:
		return False
	a										=							len(__lowerCamelCase    ) // 2
	if a_list[midpoint] == item:
		return True
	if item < a_list[midpoint]:
		return binary_search(a_list[:midpoint]							,			__lowerCamelCase    )
	else:
		return binary_search(a_list[midpoint + 1 :]							,			__lowerCamelCase    )


if __name__ == "__main__":
		__UpperCamelCase					:       Dict    					=      input("Enter numbers separated by comma:\n").strip()
		__UpperCamelCase					:       List[str]    					=      [int(item.strip()) for item in user_input.split(",")]
		__UpperCamelCase					:       int    					=      int(input("Enter the number to be found in the list:\n").strip())
		__UpperCamelCase					:       Union[str, Any]    					=      "" if binary_search(sequence, target) else "not "
		print(F'{target} was {not_str}found in {sequence}')







from __future__ import annotations





def 		__A		(	__lowerCamelCase							,			__lowerCamelCase    )      ->       float:
	a										=							sorted(numsa + numsa    )
	a				, a										=							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()
		__UpperCamelCase					:       Tuple    					=      [float(x) for x in input("Enter the elements of first array: ").split()]
		__UpperCamelCase					:       List[Any]    					=      [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)}')

