


def     lowerCAmelCase_					( __lowerCamelCase     ):
							__snake_case		:      Optional[int]										=       n ** (1 / 3)
							return (val * val * val) == n


if __name__ == "__main__":
			print(perfect_cube(27))
			print(perfect_cube(4))





def     lowerCAmelCase_					( __lowerCamelCase							,     __lowerCamelCase     ):
							return x if y == 0 else greatest_common_divisor(__lowerCamelCase							,     x % y     )







def     lowerCAmelCase_					( __lowerCamelCase							,     __lowerCamelCase     ):
							return (x * y) // greatest_common_divisor(__lowerCamelCase							,     __lowerCamelCase     )







def     lowerCAmelCase_					( __lowerCamelCase = 2_0     ):
							__snake_case		:      Optional[Any]										=       1
							for i in range(1							,     n + 1     ):
														__snake_case		:      Any										=       lcm(__lowerCamelCase							,     __lowerCamelCase     )
							return g


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

