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

program ABC166_D
  integer::A
  integer::C(10000)
  double precision::X
  C=0
  read(*,*)X
  N=0
  A=int(sqrt(X))
  do i=1,A
     if(int(X)/i*i==int(X)) then
        N=N+1
        C(N)=i
     end if
  end do
  do i=1,N
     do j=-100000000,100000000
        if(C(i)*(5*j**4+10*(j**3)*C(i)+10*(j**2)*(C(i)**2)+5*j*(C(i)**3)+C(i)**4)==int(X)) then
           write(*,*)C(i)+j,j
           stop
        end if
     end do
  end do
end program ABC166_D