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>
#define rep( i, n ) for (long long i = 0; i < ( long long )(n); i++)

using namespace std;
typedef long long ll;
typedef pair< int , int > P;
typedef tuple<int, int, int> T;


int main(){
  ll x;
  cin>>x;
  map<ll,ll> c;
  for(int i = 0 ;i<1000;i++){
    c[i*i*i*i*i]=i;
  }

  for(int i = 0 ;i<1000;i++) {
    ll d = i*i*i*i*i;
    if(x-d>0&&c[x-d]!=0){
      cout<<i<<" "<<-c[x-d];
      //cout<<"k";
      return 0;
    }
    else if(x-d<0&&c[d-x]!=0){
      cout<<i<<" "<<c[d-x];
      return 0;
    }
    else if(x-d==0) {
      cout<<i<<" "<<"0";
      return 0;
    }
  }
}