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:
/*package whatever //do not write package name here */
import java.util.*;
import java.lang.Math;
import java.io.*;

class Main {
	public static void main (String[] args) {
// 		System.out.println("GfG!");
		Scanner input=new Scanner(System.in);
		double n=input.nextDouble();
		outer:for(double i=0;i<=100000;i++)
		{
		    for(double j=-100000;j<=100000;j++)
		    {
		        if((Math.pow(i,5)-Math.pow(j,5))==n)
		        {
		            System.out.println((int)i + " " + (int)j);
		            break outer;
		        }
		    }
		}
		input.close();
	}
}