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: Time Limit Exceeded)

#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <iostream>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <bitset>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)

using namespace std;
typedef long long ll;
const ll MOD=1e9+7;

int main() {
    std::ios::sync_with_stdio(0); cin.tie(0);

    ll i,j,h;
    ll Q,M,K,P,A,B,N,X;

    long double x;

    string S;

    ll ans=0;
    ll count=0;
    ll flag=0;
    ll temp=0;

vector<ll> aa, bb, hh, ff;
ll a,b;
    cin >>X;
    ll d;

    ll iii=3;
    //cout<<pow(iii,0.2)<<endl;
    //return 0;

repr(i,-10000000,10000000){
    if(pow(i,5)-X>=0){
        if(pow(pow(pow(i,5)-X,1/5),5)==pow(i,5)-X){
            cout<<i<<" "<<pow(pow(i,5)-X,1/5)<<endl;
            break;
        }
    }else{
        if(pow(pow(-(pow(i,5)-X),1/5),5)==-(pow(i,5)-X)){
            cout<<i<<" "<<-pow(-(pow(i,5)-X),1/5)<<endl;
            break;
        }
        
    }
}


//rep(i,N)cout<<ff[i];

    return 0;
}