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: Wrong Answer)

import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
    x = int(input())
    p1 = 1
    while True:
        p15 = p1 ** 5
        rt1 = ((x + p15) ** 0.2) % 1
        if rt1 == 0:
            r = (int((x + p15) ** 0.2), p15)
            break
        if (x - p15) < 0:
            rt2 = ((-1*(x - p15)) ** 0.2) % 1
            if rt2 == 0:
                r = (int((-1*(x - p15)) ** 0.2), -p15)
                break
        else:
            rt3 = ((x - p15) ** 0.2) % 1
            if rt3 == 0:
                r = (int((x - p15) ** 0.2), -p15)
                break
        p1 += 1
    print(*r, sep=' ')
if __name__ == '__main__':
    main()