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 Fortran (GNU Fortran 9.2.1) (judge verdict: Accepted)

program sample
implicit none
integer(8)X,k,i
integer(8) A,B,A1,B1
read(*,*)X
A1=0
B1=0
do A=-150,150
do B=-150,150
if (A**5-B**5==X) then
A1=A
B1=B
end if
end do
end do
write(*,*) A1,B1
stop
end program sample