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 CPP):

Solution:
#include<cstdio>

#define int long long

int x;

const int low=-200;
const int high=200;

signed main(){
	scanf("%lld",&x);
	for(int a=low;a<=high;++a)for(int b=low;b<=high;++b){
		if(a*a*a*a*a-b*b*b*b*b==x)return printf("%lld %lld\n",a,b),0;
	}
	return 0;
}