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++ (Clang 10.0.0) (judge verdict: Wrong Answer)

#include<iostream>
#include<string>
#include <vector>
#include <algorithm> 
#include <list>

using namespace std;

int main(){
    long long  x;
    cin >>x;
    for(int a= -10000;a<=10000;a++){
      for(int b = 10000;b>=-10000;b--){
        long long c = (a*a*a*a*a)-(b*b*b*b*b);
          if(x == c){
           cout<<a<<" "<<b<<endl;
           return 0;
          }
      }     
    }
}