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 {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

		long x = sc.nextLong();

		LinkedList<Long> ll = new LinkedList<Long>();
		for ( int i=0; i<=300; i++ ) {
			ll.add((long)Math.pow(i,5));
		}

		for ( int i=-300; i<=300; i++ ) {
			long a5 = 0;
			if ( i>=0 ) {
				a5 = ll.get(i);
			} else {
				a5 = 0l - ll.get(0-i);
			}
			for ( int j=-300; j<i; j++ ) {
				long b5 = 0;
				if ( j>=0 ) {
					b5 = ll.get(j);
				} else {
					b5 = 0l - ll.get(0-j);
				}
				if ( a5>b5 && x==a5-b5 ) {
					System.out.println(i + " " + j);
					System.exit(0);
				}
			}
		}
	}
}