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;

// https://atcoder.jp/contests/abc166/tasks/abc166_D
public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ

		Scanner sc = new Scanner(System.in);
		long x = sc.nextLong();
		sc.close();

		for (long i = 1L; i * i <= x; i++) {
			if (x % i == 0) {
				//				System.out.println("i："+i);
				for (long a = -220; a <= 220; a++) {
					for (long b = -220; b <= 220; b++) {
						long xx = (long) (Math.pow(a, 5) - Math.pow(b, 5));
						if (xx == x) {
							System.out.println(a + " " + b);
							return;
						}
					}
				}
			}
		}

	}
}