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 PyPy3 (7.3.0) (judge verdict: Time Limit Exceeded)

import sys
N=int(input())


for i in range(-64,64):
    for j in range(-64,64):
        if i**5-j**5==N:
            print(i,j)
            sys.exit(0)

a=65
b=64
for i in range(10000000):
    ass=a**5-b**5
    if ass==N:
        print(a,b)
        sys.exit(0)
    elif ass>N:
        b+=1
    else:
        a+=1