



"""simple docstring"""







from __future__ import annotations

def 				UpperCamelCase_    (    lowerCAmelCase__      :				list[int]    ,   lowerCAmelCase__      :				int						)						->   bool:

  """simple docstring"""




  if len(lowerCAmelCase__						) == 0:
    return False
  lowerCAmelCase_   :				Union[str, 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__":
     lowercase__		:				str          =	input("""Enter numbers separated by comma:\n""").strip()
     lowercase__		:				Optional[int]          =	[int(item.strip()) for item in user_input.split(""",""")]
     lowercase__		:				Optional[Any]          =	int(input("""Enter the number to be found in the list:\n""").strip())
     lowercase__		:				int          =	"""""" if binary_search(sequence, target) else """not """
     print(f'{target} was {not_str}found in {sequence}')










"""simple docstring"""







def 				UpperCamelCase_    (    lowerCAmelCase__      :				int = 100						)						->   int:

  """simple docstring"""




  lowerCAmelCase_   :				Any								= (n * (n + 1) // 2) ** 2
  lowerCAmelCase_   :				Optional[int]								= n * (n + 1) * (2 * n + 1) // 6
  return sum_cubes - sum_squares


if __name__ == "__main__":
     print(f'{solution() = }')





