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<iostream>
#include<cmath>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
 
bool is_integer(double x) {
    return std::floor(x) == x;
}
 
int main()
{
    int x;
    cin >> x;
    int a = 0;
    for (int b = -118; b <= 119; b++)
    {
        double ans = x + pow(b, 5);
        if (ans < 0)continue;
        ans = pow(ans, 0.2);
        if (is_integer(ans))
        {
            cout << ans << " " << b << endl;
            return 0;
        }
    }
 
    return 0;
}