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);
		
		long X = sc.nextLong();
		
		for(int i=1; i*i<=X; i++) {
			if(X%i==0) {
				for(long A=0; A<300; A++) {
					long B = A-i;
					if(Math.abs(B)>=300)
						continue;
					long ans = A*A*A*A*A - B*B*B*B*B;
					if(ans == X) {
						System.out.println(A + " " + B);
						sc.close();
						return;
					} else if(B>0 && ans > X) {
						break;
					}
				}
			}
		}
		
		sc.close();
	}
}