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) {
		Scanner scan = new Scanner(System.in);
		
		int x = scan.nextInt();
		scan.close();
		
		long b = -1000;
		while(true) {
			long a = x + (long)Math.pow(b, 5);
			if(is5root(a)) {
				System.out.println((long)Math.pow(a, 0.2) + " " + b);
				return;
			}
			b++;
		}
		
	}
	
	public static boolean is5root(long a) {
		long b = (long)Math.pow(a,0.2);
		long c = (long)Math.pow(b, 5);
		return a == c;
	}

}