Problem: 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

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

Examples

Input

33


Output

2 -1


Input

1


Output

0 -1

Solution (in JAVA):

Solution:


import java.math.BigInteger;
        import java.util.Scanner;





public class Main {
    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        BigInteger x = cin.nextBigInteger();
        for(int i = -200;i <= 200;i++){
            for(int j = -200;j <= 200;j++){
                BigInteger a = BigInteger.valueOf(i);
                BigInteger b = BigInteger.valueOf(j);
                BigInteger cur = a.pow(5);
                BigInteger cnt = b.pow(5);
                BigInteger ans = cur.subtract(cnt);
                if(ans.equals(x)){
                    System.out.println(i + " " + j);return ;
                }
            }
        }
    }
}