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.Arrays;
import java.util.Scanner;
import java.util.stream.LongStream;

public class Main {

	public static void main(String[] args) {
		try (Scanner scanner = new Scanner(System.in)) {
			long x = scanner.nextLong();
			long[] array = LongStream.range(0, 10000).map(i -> i * i * i * i * i).toArray();
			for (int i = 0; i < 10000; i++) {
				int a;
				if ((a = Arrays.binarySearch(array, x + array[i])) >= 0) {
					System.out.println(a + " " + i);
					break;
				} else if ((a = Arrays.binarySearch(array, x - array[i])) >= 0) {
					System.out.println(a + " -" + i);
					break;
				}
			}
		}
	}
}