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 sc = new Scanner(System.in);
		int x =  Integer.parseInt(sc.next());		
		long[] l = new long[121];
		for(int i = 0 ; i < 121 ; i++) {
			l[i] = multiplication(i);
		}
		
		boolean flag = false;
		int a = 0;
		int b = 0;
		for(int i = 0 ; i < 121 ; i++) {
			long temp = Math.abs(l[i] - x);
			for(int j = 0 ; j < 121 ; j++) {
				if(l[j] == temp) {
					flag = true;
					a = i;
					b = j;
					break;
				} 
				if(flag) {
					break;
				}
			}
			
			
		}
		
		
		long ans_a = multiplication(a);
		long ans_b = multiplication(b);
		
		if(ans_a + ans_b == x) {
			System.out.println(a + " " + -b);
		}else if(ans_a - ans_b == x) {
			System.out.println(a + " " + b);
		}else{
			System.out.println(b + " " + a);
		}
	 }

	
	
	public static long multiplication(int i) {
		
		long temp = i * i;
		temp = temp * temp * i;
		return temp;
	}
	
}