



from __future__ import annotations





def 		a__      (		_UpperCamelCase      :			list[int]			,_UpperCamelCase      :			int				):
   if len(_UpperCamelCase				) == 0:
      return False
   __lowerCamelCase    				=     len(_UpperCamelCase				) // 2
   if a_list[midpoint] == item:
      return True
   if item < a_list[midpoint]:
      return binary_search(a_list[:midpoint]			,_UpperCamelCase				)
   else:
      return binary_search(a_list[midpoint + 1 :]			,_UpperCamelCase				)


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}")











def 		a__      (		_UpperCamelCase      :			int			,_UpperCamelCase      :			int				):
   while second != 0:
      __lowerCamelCase    				=     first & second
      first ^= second
      __lowerCamelCase    				=     c << 1
   return first


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  a_								=       int(input("""Enter the first number: """).strip())
  a_								=       int(input("""Enter the second number: """).strip())
  print(f"{add(first, second) = }")






