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();
		outside: for(int i=0; i<=3333; i++){
			for(int j=0; j<=3333; j++){
				long li = (long)i;
				long lj = (long)j;
				long A5 = li*li*li*li*li;
				long B5 = lj*lj*lj*lj*lj;
				long B52 = -lj*-lj*-lj*-lj*-lj;
				if(A5-B5 == x){
					System.out.println(i+" "+j);
					break outside;
				}
				if(A5-B52 == x){
					System.out.println(i+" "+(-j));
					break outside;
				}
			}	
		}
	}
}