good = [x for x in range(10 ** 7) if pow(pow(x, 1 / 3), 3) == x]
good_cubes = [(x ** 3) for x in range(1000) if pow(pow(x ** 3, 1 / 3), 3) ==
    x ** 3]
Create a program that returns the smallest cube which exceeds a non-negative integer n