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 Python (3.8.2) (judge verdict: Accepted)


    

def main():
    X = int(input())


    def isOK(A, B):
        eq = A**5 - B**5
        if X >= eq:
            return True
        else:
            False
    
    def bin_search(B):
        # search A
        left = B + 1
        right = 10 ** 4 * 2

        while right - left > 1:
            mid = left + (right - left) // 2
            if isOK(mid, B):
                left = mid
            else:
                right = mid

        return left
    

    for B in range(-10**4, 10**4 + 1):
        A = bin_search(B)
        if A**5 - B**5 == X:
            print(A, B)
            exit()


if __name__ == "__main__":
    main()