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>
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, n) for(int i = 0; i <= n; i++)
#define ll long long
using namespace std;

int keta(int n) {
    int res;
    for(int i = 0; i < 100; i++) {
        n = n / 10;

        if(n == 0) {
            res = i + 1;
            break;
        }
    }
    return res;
}

ll risi(ll n) {
    ll y = n / 100;
    ll res;
    res = n + y;
    return res;
}
int main() {
    ll x, ansf = 0, anss = 0;
    cin >> x;
    REP(a, 90000) {
        ll p = a * a * a * a * a;
        REP(b, 90000) {
            ll q = b * b * b * b * b;
            if(p - q == x) {
                ansf = a;
                anss = b;
                goto OUT;

            } else if(p + q == x) {
                ansf = a;
                anss = -b;
                goto OUT;
            }
        }
    }
OUT:
    cout << ansf << " " << anss << endl;
}