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<stdio.h>
#include<math.h>

long double gojo(double x)
{
    double jijo=x*x;
    return jijo*jijo*x;
}

int main()
{
    double x;
    double tmp;
    scanf("%d",&x);
    int i=0;
    long double ab;
    while (1)
    {
        int flag=0;
        ab=gojo(i)-x;
        if (ab<0) {
            ab=-ab;
            flag=1;
        }
        tmp=pow(ab,0.2);
        if ((floor(tmp)==tmp)&&i>(int)tmp) {
            if (flag==1) printf("%d %d\n",i,-(int)tmp);
            else printf("%d %d\n",i,(int)tmp);
            return 0;
        }
        i++;
    }
}