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.io.*;

import java.util.*;

class pair{
	int a ;int b;
	public pair(int a,int b){
		this.a=a;
		this.b=b;
	}}

public class Main {
	
	 static long fun(long n,int i) 
	    { 
	         return (long)Math.pow(n,i);
	    } 

	public static void main(String[] args) throws IOException 
	{ 
		Scanner s=new Scanner(System.in);
		long x=s.nextLong();
		long a=0;
		long b=0;
		boolean fl=false;
		for (int i = 0; i < 10000; i++) {
			a=i;
			for (int j = 0; j < 10000; j++) {
				
				b=j;
			long tt1=(a-b)*(fun(a,4) + fun(a,3)*b + fun(a,2)*fun(b,2) + a*fun(b,3) + fun(b,4));
			long tt2=(a+b)*(fun(a,4) - fun(a,3)*b + fun(a,2)*fun(b,2) - a*fun(b,3) + fun(b,4));
				if(tt1==x) {
					System.out.println(a+" "+b);
					return;
				}
				if(tt2==x) {
					System.out.println(a+" "+-b);
					return;
					
				}
			}
		}

	}


}