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;
class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int x = sc.nextInt();
		int a=0,b=0;
		int c=0,d=0;
		boolean e = true;
		for(;e;) {
			if(!e) break;
			a++;
			b++;
			for(int i = 0;i<a;i++) {
				
				if(!e)break;
				if(i%2 == 0) c=i/2;
				else c=-i/2;
				for(int j = 0;j<b; j++) {
					if(j%2 == 0)d=j/2;
					else d=-j/2;
					if(Math.pow(c, 5)-Math.pow(d, 5)==x) e =false;
					if(!e) break;
				}
			}
		}
		System.out.println(c+" "+d);
	}
}