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 n= sc.nextLong();
		long temp=0;
		long a=0;
		long b;
		while(true){
			a++;
          	double t=Math.pow(a,5)-n;
          	if(t>=0){
            	b=(long)Math.pow(t,0.2);
            }else{
            	b=-(long)Math.pow(-t,0.2);
            }
			temp=(long)(Math.pow(a,5)-Math.pow(b,5));
			if(temp==n){
				break;
			}
		}
		
		System.out.println(a+" "+b);
	}
}