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>
#include<math.h>
#include<queue>
#include<cstdio>
#include<set>
#include<map>
using namespace std;
using ll = long long;

int main(){
    ll X;
    cin >> X;
    ll A,B;
  	A=-1;
    for(int i=1; i<=1000; i++){
        ll a=i*i*i*i*i;
        ll b=a-X;
      	bool c;
        if(b<0){
            b = -b;
            c=true;
        }else{
            c=false;
        }
        for(int j=0; j<=1000; j++){
            ll d=j*j*j*j*j;
            if(d==b){
                A=i;
                if(c) B=-j;
                else B=j;
                break;
            }
        }
      	if(A!=-1) break;
    }
    cout << A << " " << B << endl;
    return 0;
}