

def     lowerCAmelCase__							(		SCREAMING_SNAKE_CASE_:							int					)	->					bool:




				'''simple docstring'''





				A__						=	n ** (1 / 3)
				return (val * val * val) == n


if __name__ == "__main__":
	print(perfect_cube(2_7))
	print(perfect_cube(4))








'''simple docstring'''







def  _lowerCamelCase				( lowercase						:      int = 100						)	->	int:
				_a								= 0
				_a								= 0
				for i in range(1    ,							n + 1						):
								sum_of_squares += i**2
								sum_of_ints += i
				return sum_of_ints**2 - sum_of_squares


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