


'''simple docstring'''




class  lowerCAmelCase				:



	def __init__(					self ,					snake_case__    ):
		lowerCAmelCase					:    Optional[Any]      							= len(snake_case__    )
		lowerCAmelCase					:    Tuple      							= [0] * len_array

		if len_array > 0:
			lowerCAmelCase					:    Optional[int]      							= array[0]

		for i in range(1 ,					snake_case__    ):
			lowerCAmelCase					:    Any      							= self.prefix_sum[i - 1] + array[i]



	def 				lowercase     (					self ,					snake_case__ ,					snake_case__    ):
		if start == 0:
			return self.prefix_sum[end]

		return self.prefix_sum[end] - self.prefix_sum[start - 1]



	def 				lowercase     (					self ,					snake_case__    ):
		lowerCAmelCase					:    Optional[Any]      							= {0}
		for sum_item in self.prefix_sum:
			if sum_item - target_sum in sums:
				return True

			sums.add(snake_case__    )

		return False


if __name__ == "__main__":
				import doctest

				doctest.testmod()



'''simple docstring'''




import math

def 			__UpperCamelCase    (    _A    :				int = 1_00				)    ->      int:




	"""simple docstring"""





	lowerCAmelCase					:    List[Any]      							= sum(i * i for i in range(1					,   n + 1				)				)
	lowerCAmelCase					:    Optional[Any]      							= int(math.pow(sum(range(1					,   n + 1				)				)					,   2				)				)
	return square_of_sum - sum_of_squares


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