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.io.*;
import java.math.*;
import java.util.*;
public class Main {

	public static void main(String[] args) {
		long mod = (long)(1e9+7);
		Scanner input = new Scanner(System.in);
		long X = input.nextLong();
		long[] ans = SOLVE(X);
		System.out.println(ans[0]+" "+ans[1]);
	}
	public static long[] SOLVE(long X) {
		long[] ans = new long[2];
		for (long A = 0;;A++) {
			long START = (long)(Math.pow(A,5));
			long diff = START-X;
			for (int B = 0;;B++) {
				if (Math.pow(B, 5)==Math.abs(diff)) {
					if (diff<0) {
						ans[0]=A;
						ans[1]=-B;
					} 
					else {
						ans[0]=A;
						ans[1]=B;
					}
					return ans;
				}
				if (Math.pow(B, 5)>Math.abs(diff)) break;
			}
		}
	}
}