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: Wrong Answer)

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int INF = 1000000000; // 10^9


int logn(int base, int antilog) {
    return log(antilog) / log((int)base);
}

int main() {
    // ifstream in("data1.txt");
    // cin.rdbuf(in.rdbuf());
    int X;
    cin >> X;
    // for (int i = 0; i < X; i++){
    //     int x = X - 1;
    //     int y = X + 1;
    //     int z = pow(i, 5);
    //     if(z == x || z == y) {
    //         if(z==x){
    //             cout << i << " " << -1 << endl;
    //             return 0;
    //         } else {
    //             cout << i << " " << 1 << endl;
    //             return 0;
    //         }
    //     }
    // }
    cout << logn(5, X) << " " << -1 << endl;
}