
import math





def 	SCREAMING_SNAKE_CASE__    (      __lowerCAmelCase = 100							):
    snake_case__						=				sum(i * i for i in range(1    ,		n + 1							)							)
    snake_case__						=				int(math.pow(sum(range(1    ,		n + 1							)							)    ,		2							)							)
    return square_of_sum - sum_of_squares


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





from __future__ import annotations





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



