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.math.BigInteger;
import java.util.Scanner;

public class Main
{
	public static void main(String[] args)
	{
		Scanner sc = new Scanner(System.in);
		BigInteger x = BigInteger.valueOf(sc.nextInt());
		sc.close();
		int i=0;
		int j=0;
		for (i=-100; i<1000; i++) {
			for (j=-100; j<1000; j++) {
				BigInteger a = BigInteger.valueOf(i).pow(5);
				BigInteger b = BigInteger.valueOf(j).pow(5);
				if (a.subtract(b).equals(x)) {
					System.out.println(i + " " + j);
					return;
				}
			}
		}

	}
}