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 main
  implicit none
  integer(8) :: x
  integer(8) :: str, ai, a
  real(8) :: rtmp, ar

  read *, x

  str = real(x) ** (1.0/5.0)
  rtmp = real(x) ** (1.0/5.0)

  do 
    if ( str == rtmp ) then
      print *, str, '0'
      exit
    else
      a = x - str**5
      ai = real(a) ** (1.0/5.0)
      ar = real(a) ** (1.0/5.0)
      if ( ai == ar ) then
        print *, str, (-1)*ai
        exit
      else
        str = str + 1
      end if
    end if
  end do

end program main