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 <iostream>
#include<bits/stdc++.h>
using namespace std;

int main() {
    long long int x,t1,t2;
    cin>>x;
    long long int a[150];
    for(long int i=0;i<150;i++)
    {
        a[i]=i*i*i*i*i;
    }
    for(long int i=0;i<150;i++)
    {
        t1=x+a[i];
        t2=x-a[i];
        for(long int j=0;j<150;j++)
        {
            if(t1==a[j])
            {
                cout<<j<<" "<<i;
                return 0;
            }
            else if(t2==a[j])
            {
                cout<<j<<" "<<(-1*i);
                return 0;
            }
            else if(t2==(-1*a[j]))
            {
                cout<<(-1*j)<<" "<<(-1*i);
                return 0;
            }
        }
    }
	return 0;
}