






def 		SCREAMING_SNAKE_CASE							( __lowerCAmelCase = 100      )			->     int:
     UpperCamelCase__      :       str	    =  n * (n + 1) * (2 * n + 1) / 6
     UpperCamelCase__      :       List[Any]	    =  (n * (n + 1) / 2) ** 2
     return int(square_of_sum - sum_of_squares      )


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







from __future__ import annotations







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