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 ll=long long;
using namespace std;
int main(void){
  int x; cin>>x;
  int q=sqrtl(sqrtl(x));
  for(ll a=-q; abs(a)<=q; ++a) for(ll b=-q; abs(b)<=q; ++b) if(a*a*a*a*a-b*b*b*b*b==x){ printf("%lld %lld\n",a,b); return 0;}
  return 0;
}