






import math







def   SCREAMING_SNAKE_CASE       (				snake_case_      :							int = 100     ):
	snake_case__				:   Tuple     =						sum(i * i for i in range(1  ,						n + 1     )     )
	snake_case__				:   Optional[int]     =						int(math.pow(sum(range(1  ,						n + 1     )     )  ,						2     )     )
	return square_of_sum - sum_of_squares


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











def   SCREAMING_SNAKE_CASE       (				snake_case_      :							str     ):
	snake_case__				:   Any     =						[0] * len(snake_case_     )

	for i in range(1  ,						len(snake_case_     )     ):
		# use last results for better performance - dynamic programming
		snake_case__				:   Union[str, Any]     =						prefix_result[i - 1]
		while j > 0 and input_string[i] != input_string[j]:
			snake_case__				:   str     =						prefix_result[j - 1]

		if input_string[i] == input_string[j]:
			j += 1
		snake_case__				:   int     =						j

	return prefix_result







def   SCREAMING_SNAKE_CASE       (				snake_case_      :							str     ):
	return max(prefix_function(snake_case_     )     )


if __name__ == "__main__":
	import doctest

	doctest.testmod()



