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: Runtime Error)

#define _GLIBCXX_DEBUG
#include <iostream>
#include <cstdint>
#include <vector>
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
i64 p5(int x){return x * x * x * x * x;}

int main(void){
    int x;
    cin >> x;
    vi P5(68);
    for(int i=1; i<68; i++) P5[i] = p5(i);
    for(int a=1; true; a++){
        int a5 = P5[a];
        for(int b=-a; b<a; b++){
            int b5 = (b<0? -P5[-b] : P5[b]);
            if(a5+b5 == x){
                cout << a << ' ' << b << '\n';
                return 0;
            }
        }
    }
    return 0;
}