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>
using namespace std;

int main() {
   long long  x;
  cin>> x;
  cout<<x<<endl;
  int iti,ni;
  iti =ni=0;
  
  vector<unsigned long long> koho(200);
  
  for (int i = 0; i < 200; i++) {koho.at(i)=i*i*i*i; koho.at(i)*=i;}
   cout<<koho.at(199)<<endl;
  for (int i = 1; i < 200; i++) {
    for(int j = 0; j < i; j++) {
      if(x-koho.at(i)==koho.at(j))
      {iti=i;ni=j;break;}
    }
    if(x-koho.at(iti)==koho.at(ni)) {cout<<iti << " "<<ni<<endl;break;}
      }
  if(iti>0&&ni>0){cout<<iti<<" -"<<ni;}
  else if(iti>0&&ni==0){cout<<iti<<" "<<ni;}
  else {
    for (int i = 1; i < 200; i++) {
    for(int j = 0; j < i; j++) {
      if(koho.at(i)-x==koho.at(j))
      { iti=i;ni=j;break;}
    }
       if(koho.at(iti)-x==koho.at(ni)){cout<<iti << " "<<ni<<endl;break;}
      }
  }
}