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: Time Limit Exceeded)

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1000000007;
using Graph = vector<vector<int>>;

signed main() {
  int X;
  cin >> X;
  
  for( int i = 1; ; i++ ){
    int A = i*i*i*i*i;
    int sa = abs(X-A);
    for( int j = 0; j < 5; j++ ) sa = sqrt(sa);
    if( pow(sa, 5) != abs(X-A) ) continue;
    if( X-A > 0 ) cout << i << " " << -1*sa << endl;
    else cout << i << " " << sa << endl;
    return 0;
  }
}