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 int long long
#define ld long double
#define sd second
#define ft first

#define ios                           \
    std::ios::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);

int32_t main()
{
    ios;
    int x;
    cin >> x;
    map<int, int> mp;
    for (int i = -1000; i < 1000; i++)
    {
        mp[i] = i * i * i * i * i;
    }
    int ta, tb;
    for (auto a : mp)
    {
        for (auto b : mp)
        {
            if ((a.sd - b.sd) == x)
            {
                ta = a.ft;
                tb = b.sd;
            }
        }
    }
    cout << ta << " " << tb << endl;
    return 0;
}