Problem:
Score : 400 points

Problem Statement

Give a pair of integers (A, B) such that A^5-B^5 = X.
It is guaranteed that there exists such a pair for the given integer X.

Constraints

1 \leq X \leq 10^9

X is an integer.

There exists a pair of integers (A, B) satisfying the condition in Problem Statement.

Input

Input is given from Standard Input in the following format:

X

Output

Print A and B, with space in between.
If there are multiple pairs of integers (A, B) satisfying the condition, you may print any of them.

A B

Sample Input 1

33

Sample Output 1

2 -1

For A=2 and B=-1, A^5-B^5 = 33.

Sample Input 2

1

Sample Output 2

0 -1

Solution in Julia (1.4.0) (judge verdict: Wrong Answer)

function f()
    x=parse(Int,readline())
    x1=0
    for a=0:floor(x^(1/5))
        for b=-floor(x^(1/5)):0
            if x%(a-b) == 0
                print(1)
                x1 = x/(a-b)
                if x1 == a^4+a*b^3+a^2*b^2+a*b^3+b^4
                    print("$a $b")
                    exit()
                end
            end
        end
    end
end
f()