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.Scanner;

public class Main {
	public static void main(String[] args) {
		var sc = new Scanner(System.in);
		var x = sc.nextInt();
		sc.close();

		var a = 0;
		var b = 0;
		for (var i = 0; i <= 1000; i++) {
			for (var j = -1000; j <= 1000; j++) {
				var value = (long)Math.pow(i, 5) - (long)Math.pow(j, 5);
				if (value == x) {
					a = i;
					b = j;
					break;
				};
			}
		}

		System.out.println(String.format("%d %d", a, b));
	}
}