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.util.ArrayDeque;
import java.util.Queue;
import java.math.RoundingMode;
import java.math.BigDecimal;
 
 
 
public class Main{
	 public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int x = sc.nextInt();
		long[] pow = new long[120];
		for(int i = 0; i < 120; i++) {
			long a = (long)i;
			pow[i]=a*a*a*a*a;
			//System.out.println(pow[i]);
		}
		int a = 0;
		int b = 0;
		for(int i = 0; i < 120; i++) {
			long powa = pow[i];
			for(int j = 0; j < 120; j++) {
				long powb = pow[j];
				if(powa-powb==(long)x) {
					a = i;
					b = j;
					break;
				}
				if(powa+powb==(long)x) {
					a = i;
					b = -j;
					//System.out.println(a);
					break;
				}
			}
			if(a!=0||b!=0)break;
		}
		if(a!=0||b!=0) {
			System.out.println(a+" "+b);
		}
	 }
}