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: Accepted)

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;

int main(){
    long X;
    cin >> X;

    long A, B;
    A = 120;
    for(A = 120; A >= 0; A--){
        for(B = A-1; B > -120; B--){
            if(pow(A, 5) - pow(B, 5) > X){
                break;
            }
            if(pow(A, 5) - pow(B, 5) == X){
                cout << A << " " << B << endl;
                return 0;
            }

        }
    }

    // for(int i = 180; i >= 100; i--){
    //     ans = pow(i, 5) - pow(i-1, 5);
    //     printf("i = %d, %ld\n", i, ans);
    //     if (ans < 1000000000) break;
    // }

    // A = pow(X, 0.25);

    // cout << pow(177, 5) - pow(176, 5) << endl;


    return 0;
}