






"""simple docstring"""
def       __UpperCamelCase						(		snake_case__ = 100       ):
	A_		:    Any						     = 0
	A_		:    Optional[int]						     = 0
	for i in range(1 , n + 1       ):
		sum_of_squares += i**2
		sum_of_ints += i
	return sum_of_ints**2 - sum_of_squares


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









"""simple docstring"""
from __future__ import annotations






def       __UpperCamelCase						(		snake_case__ , snake_case__       ):
	if len(snake_case__       ) == 0:
		return False
	A_		:    Union[str, Any]						     = len(snake_case__       ) // 2
	if a_list[midpoint] == item:
		return True
	if item < a_list[midpoint]:
		return binary_search(a_list[:midpoint] , snake_case__       )
	else:
		return binary_search(a_list[midpoint + 1 :] , snake_case__       )


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

