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 i_hate_factorization
    integer(8) X
    integer i, j
    integer :: ans = 0
    logical :: det = .false.
    read *, X
    do i = -100, 100, 1
        do j = -100, 100, 1
            ans = ((i**5)-(j**5))
            if(x == ans)then
                det = .true.
                print "('',i0)", i, j
                exit
            end if
        end do
        if(det .eqv. .true.)exit
    end do
end program