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.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		long count = 5404;
		Map<Long, Long> map = new HashMap<>();
		List<Long> list = new ArrayList<>();
		for (int i = 0; i < count * 2 + 1; i++) {
			long hoge = (long) Math.pow(count - i, 5);
			list.add(hoge);
			map.put(hoge, count - i);
		}
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		sc.close();
		for (int i = 0; i < list.size(); i++) {
			long a = list.get(i);
			for (int j = 0; j < list.size(); j++) {
				long b = list.get(j);
				if (a - b == n) {
					System.out.println(map.get(a) + " " + map.get(b));
					return;
				}
			}
		}
	}
}