

def        SCREAMING_SNAKE_CASE__	(  lowerCamelCase__      )  ->					str:
	__lowerCamelCase    :    List[Any] 	=			int(lowerCamelCase__      )
	if decimal in (0, 1):  # Exit cases for the recursion
		return str(lowerCamelCase__      )
	__lowerCamelCase	,			__lowerCamelCase    :    Tuple 	=			divmod(lowerCamelCase__     ,			2      )
	return binary_recursive(lowerCamelCase__      ) + str(lowerCamelCase__      )






def        SCREAMING_SNAKE_CASE__	(  lowerCamelCase__      )  ->					str:
	__lowerCamelCase    :    Tuple 	=			str(lowerCamelCase__      ).strip()
	if not number:
		raise ValueError('No input value was provided'      )
	__lowerCamelCase    :    List[Any] 	=			'-' if number.startswith('-'      ) else ''
	__lowerCamelCase    :    Any 	=			number.lstrip('-'      )
	if not number.isnumeric():
		raise ValueError('Input value is not an integer'      )
	return F"{negative}0b{binary_recursive(int(lowerCamelCase__      )      )}"


if __name__ == "__main__":
					from doctest import testmod

					testmod()







from __future__ import annotations






def        SCREAMING_SNAKE_CASE__	(  lowerCamelCase__     ,			lowerCamelCase__      )  ->					bool:
	if len(lowerCamelCase__      ) == 0:
		return False
	__lowerCamelCase    :    List[Any] 	=			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__":
					a		=input("""Enter numbers separated by comma:\n""").strip()
					a		=[int(item.strip()) for item in user_input.split(""",""")]
					a		=int(input("""Enter the number to be found in the list:\n""").strip())
					a		="""""" if binary_search(sequence, target) else """not """
					print(F"""{target} was {not_str}found in {sequence}""")




