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 <iostream>
#include <cstdio>
#include <cmath>
using namespace std;

long long x, i, j;
int main() {
	cin >> x;
	for(i=-120; i<=120; i++) for(j=-120; j<=120; j++) {
		if(pow(i,5) - pow(j,5) == x) {
			cout << i << ' ' << j;
			return 0;
		}
	}
}