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 name
    use,intrinsic :: iso_fortran_env
    implicit none
    integer(int64):: x,n,i,j
    integer(int64), allocatable:: f(:)

    read*, x
    n=0
    do while( n**5 <= 100000000000000000_8)
        n=n+1
    end do
    allocate(f(-n:n))

    do i=-n,n
        f(i) = i**5
    end do

    do i=-n,n
        do j=-n,n
            if (f(i)-f(j) == x) then
                print*, i,j 
                stop
            end if
        end do
    end do
end program name