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: Accepted)

#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define endl '\n'
ll fp(ll base, ll exp)
{
    if (exp == 0)
        return 1;
    ll ans = fp(base, exp / 2);
    if (exp % 2 == 0)
        return (ans * ans);
    else
        return (((ans * ans)) * base);
}
int main()
{
    Hello
    ll x;
    cin >> x;
    vector<pair<ll, ll>> v;
    for(int i = 0; i <= 1000; i++){
        ll numb = fp(i, 5);
        v.push_back({numb, i});
        v.push_back({-numb, -i});
    }
    sort(v.begin(), v.end());
    for(int i = 0; i < (int)v.size(); i++){
        for(int j = 0; j < (int)v.size(); j++){
            if(v[i].first - v[j].first == x)
                return cout << v[i].second << " " << v[j].second, 0;
        }
    }
    return 0;
}