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 <iostream>
#include <vector>
#include <string>
#include <map>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <set>
using namespace std;
typedef long long ll;

ll f(ll i){return i*i*i*i*i;}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    ll x;cin>>x;
    vector<ll> v;
    v.push_back(0);
    map<ll,int> m;
    for(int i=1;i<=4000;i++){
        v.push_back(f(i));
        v.push_back(-1ll*f(i));
        m[f(i)]=i;
        m[f(i)*-1]=-i;
    }
    bool ok=0;
    for(int i=0;i<v.size();i++){
        ll need=x+v[i];
        if(m[need]){cout<<m[need]<<' '<<m[v[i]];return 0;}
    }
}