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 ll long long int
#define set_bits(a) __builtin_popcount(a)
#define pb push_back
#define pf push_front
#define mod 1000000007
#define M 998244353
#define fi first
#define se second
#define endl '\n'
#define INF 1e18
#define PI 3.14159265358979323846
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);


int main()
{
    ll x;
    cin>>x;

    vector<ll>v;
    ll i;
    unordered_map<ll,ll>m;
    unordered_map<ll,ll>mp;
    for(i=-100000;i<=100000;i++)
    {
        ll x = i*i*i*i*i;
        mp[x]++;
        v.pb(x);
        m[x] = i;
    }
    ll a1,a2;

    for(i=0;i<v.size();i++)
    {
        ll p =  v[i] - x;

        if(mp.find(p)!=mp.end())
        {
            a1 =  m[v[i]];
            a2 = m[p];
        }
    }


    cout<<a1<<" "<<a2<<endl;
}