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++ (Clang 10.0.0) (judge verdict: Wrong Answer)

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <cstdio>
#include <numeric>
#include <queue>

using namespace std;

using ll=long long;

ll X;

ll p5(ll a)
{
    return a*a*a*a*a;
}

int main()
{
    cin >> X;
    for(ll A = 0;A <= 64;A++)
    {
        for(ll B = 0;B <= 64;B++)
        {
            if(p5(A) - p5(B) == X)
            {
                cout << A << ' ' << B << endl;
                return 0;
            }
            else if(p5(A) + p5(B) == X)
            {
                cout << A << ' ' << -B << endl;
                return 0;
            }
        }
    }
   return 0;
}