


def    snake_case_     (  snake_case = 1_00     )  ->				int:
       lowercase__:   Dict  			=   n * (n + 1) * (2 * n + 1) / 6
       lowercase__:   Dict  			=   (n * (n + 1) / 2) ** 2
       return int(square_of_sum - sum_of_squares     )


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






from __future__ import annotations




def    snake_case_     (  snake_case			,							snake_case     )  ->				bool:
       if len(snake_case     ) == 0:
              return False
       lowercase__:   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}''')


