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;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

int main(){
    ll x;
    cin >> x;
    set<ll> st;
    st.insert(0);
    ll a = 1, lm;
    while(true){
        st.insert(pow(a, 5));
        if(pow(a+1, 5) - pow(a, 5) > 1e12){
            lm = a+1;
            break;
        }
        a++;
    }
    for(ll a = -1; a > -lm; a--){
        st.insert(pow(a, 5));
    }
    //cerr << st.size() << endl;
    bool f = false;
    for(auto s : st){
        ll b = s - x;
        //cerr << b << endl;
        if(st.count(b) > 0){
            cout << s << " " << b << endl;
            f = true;
            break;
        }
    }
    if(!f) cerr << "err" << endl;
    
    return 0;
}