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<bits/stdc++.h>
using namespace std;
int main()
{
	long long x,a,b5,b;
	cin>>x;
    for(a=-120;a<=120;a++)
    {
    	b5=a*a*a*a*a-x;
    	for(b=-120;b<=120;b++)
    	{
    		if(b5==b*b*b*b*b)
    		{
    			cout<<a<<" "<<b;
    			return 0;
			}
		}
	}
}