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

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long x = sc.nextLong();
		List<Long> list = new ArrayList<>();
		for (long i = 0; i < 200; i++) {
			list.add(i*i*i*i);
		}
		long max = 0;
		for (int i = 0; i < list.size(); i++) {
			if (x <= list.get(i)) {
				max = i;
				break;
			} else if (x == list.size()-1) {
				max = i;
				break;
			}
		}
		for (long i = (-1) * max; i <= max ; i++) {
			for (long j = (-1) * max; j <= max ; j++) {
				long cal = i*i*i*i*i - j*j*j*j*j;
				if ( cal == x) {
					System.out.println(i + " " + j);
					return;
				}
			}
		}

	}

}