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 N 200005
#define st first
#define nd second
#define pb push_back
using namespace std;
typedef long long ll;
ll n, a, b, i, j, t, x, l, r, p;
vector<ll> v;
ll cautbin(ll x, ll l, ll r)
{
    while(l!=r)
    {
        ll m=(l+r+1)/2;
        if(v[m]<=x)
            l=m;
        else r=m-1;
    }
    return l;
}
void fast()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
}
int main()
{
    fast();
    cin>>n;
    x=-2000;
    while(x*x*x*x*x<=(1LL<<62))
    {
        v.pb(x);
        ++x;
    }
    r=v.size()-1;
    for(i=0;i<v.size();++i)
    {
        p=cautbin(v[i]+n,0,r);
        if(v[p]-v[i]==n)
        {
            cout<<v[p]<<' '<<r<<'\n';
            return 0;
        }
    }
}