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);
    long x=sc.nextInt();
    long a=1,b=0,f=(long)(Math.pow(a, 5)-Math.pow(b, 5));
    while(f!=x) {
    	for(long i=-a;i<=a-1;i++) {
    		b=i;
    		f=(long)(Math.pow(a, 5)-Math.pow(b, 5));
    		if(f==x) {
    			System.out.println(a+" "+b);
    			System.exit(0);
    		}
    	}
    	a++;
    }
    System.out.println(a+" "+b);
  }
}