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.*;
import java.io.*;
 
public class Main{
 
	public static void main(String[] $){
		Scanner s = new Scanner(System.in);
        long X = s.nextLong();
        List<Integer> factor = new ArrayList<Integer>();

        long A = 0;
        long B = 0;
        boolean check = false;
        for(int i = -130; i <=130; i++){
            for(int j = -130; j <=130; j++){
                A = i; B = j;
                if(X == A*A*A*A*A - B*B*B*B*B){
                    check = true;
                    break;
                }
            }
            if(check) break;
        }
        
        System.out.println(A + " " + B);
        
        
	}
}