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 inf 0x3f3f3f3f
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double dd;
const int N = 1e5+5;
const dd eps = 1e-8;
const int mod = 1e9+7;

ll qu[N],x;
int cnt;

int main(){
  ios::sync_with_stdio(false);
  // freopen("input.txt","r",stdin);
  for(ll i = -5e3;i <= 5e3;i++){
    qu[++cnt] = i*i*i*i*i;
  }
  cin>>x;
  for(int i = 1;i <= cnt;i++){
    int inx = lower_bound(qu+1,qu+1+cnt,x+qu[i]) - qu;
    if(inx == cnt+1) continue;
    if(qu[inx] == x+qu[i]){
      cout<<(inx-5001)<<" "<<(i-5001)<<endl;
      return 0;
    }
  }
  return 0;
}