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.*;

public class Main {
	public static void main (String[] args) {
		Scanner sc = new Scanner(System.in);
		int x = sc.nextInt();
		for (int i = 1; i <= Math.sqrt(x); i++) {
		    if (x % i == 0) {
		        check(x, i);
		        check(x, x / i);
		    }
		}
	}
	
	static void check(int x, int y) {
	    int base = - (y / 2);
	    while (true) {
	        double z = Math.pow(y + base, 5) - Math.pow(base, 5);
	        if (x == z) {
    	        System.out.println((y + base) + " " + base);
    	        System.exit(0);
	        }
	        if (x < z) {
	            return;
	        }
	        base++;
	    }
	}
}