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

public class Main {
	Scanner sc = new Scanner(System.in);
	final int MOD = 998244353;
	final int MAX = Integer.MAX_VALUE;
	final long LMAX = Long.MAX_VALUE;
	int len = (int)1e6 + 1;
	
	
	void doIt() {
		int X = sc.nextInt();
		List<Integer> f = new ArrayList<>();
		for(int i = 1; i * i <= X; i++) {
			if(X % i == 0) {
				f.add(i);
			}
		}
		f.add(X);
		for(int d : f) {
			for(int a = 0; a <= 1000; a++) {
				int b = a - d;
				if(Math.pow(a, 5) - Math.pow(b, 5) == X) {
					System.out.println(a + " " + b);
					return;
				}
			}
		}
		System.out.println(Arrays.toString(f.toArray()));
	}
	
	
	public static void main(String[] args) {
		new Main().doIt();
	}

}