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 <iostream>
#include <string>
#include <vector>

using namespace std;
int main(void) {
  long long x;
  int a = 0, b = 0;
  int flag = 0;
  cin >> x;
  long long m[101];
  for (int i = 0; i <= 100; i++) {
  	m[i] = i*i*i*i*i;
  }
  
  for (int i = 0; i < 101; i++) {
  	x -= m[i];
    //cout << x << endl;
    for (int j = 0; j < 101; j++) {
    	if (x == -1*m[j]){
          a = i;
          b = j;
          flag = 1;
          break;
        } else if (x == m[j]) {
          a = i;
          b = -1*j;
          flag = 1;
          break;
        }
    }
    if (flag) {
       break;
    }
    x += m[i];
  }
  
  cout << a << " " << b << endl;
  return 0;
}