Score : 400 points
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.
Input is given from Standard Input in the following format:
X
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
33
2 -1
For A=2 and B=-1, A^5-B^5 = 33.
1
0 -1