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.util.*;
 
class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        long X = Long.parseLong(sc.next());
        int a = 0;
        int b = 0;
        if(X == 1) {
            b = -1;
        }else {
            for(int i = -(int)Math.pow(X, 1.0/5.0); i < Math.sqrt(X); i++) {
                if((float)Math.pow(X + Math.pow(i, 5), 1.0/5.0) % 1 == 0) {
                    a = (int)(Math.pow((X + Math.pow(i, 5)), 1.0/5.0));
                    b = i;
                    break;
                }
            }
        }
        
        System.out.println(a+" "+b);
    }
}