Problem:
Score : 400 points

Problem Statement

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

Sample Input 1

33

Sample Output 1

2 -1

For A=2 and B=-1, A^5-B^5 = 33.

Sample Input 2

1

Sample Output 2

0 -1

Solution in C++ (GCC 9.2.1) (judge verdict: Time Limit Exceeded)

//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>

using namespace std;


vector<int> divisor(int n) {
    vector<int> ret;
    for (int i = 1; i <= n; i++) {
        if (n % i == 0) {
            ret.push_back(n / i);
        }
    }
    return ret;
}

void solve() {
    int X; cin >> X;
    vector<int> div = divisor(X);
    
    for (int i = 0; i < div.size(); i++) {
        int d = div[i];
        for (int a = 0; a < d; a++) {
            int b = a - d;
            if ((powf(a, 5) - powf(b, 5)) == X) {
                cout << a << " " << b << endl;
                return;
            }
        }
    }
}


int main() {
    solve();
    return 0;
}