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 = sc.nextInt();
    	if(X == 0){
    		System.out.println("0 0");
    		return;
    	}
    	List<Integer> divList = getDiv((int)X);
    	for(long i = 0; i < 200; i++) {
    		long i5 = i * i * i * i * i;
    		for(int div : divList) {
    			if(i > 70 && i < div){
    				break;
    			}
    			long j = i - div;
    			long j5 = j * j * j * j * j;
    			if(i5 - j5 == X) {
    				System.out.println(i + " " + j);
    				return;
    			}
    		}
    	}
    }
	
	private static List<Integer> getDiv(int X){
		List<Integer> divList = new ArrayList<>();
		for(int i = 1; i < 200; i++) {
			if(X % i == 0) {
				divList.add(i);
			}
		}
		return divList;
	}
}