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

#include <stdio.h>

int pow5(int);

int pow5(int x)
{
    return x * x * x * x * x;
}

int main(int argc, const char **argv)
{
    int answer = 0, a = 0, b = 0;

    fscanf(stdin, "%d", &answer);

    while (1)
    {
        if ( pow5(a) - pow5(b) == answer ) break;
        if ( pow5(a) > answer + pow5(b) ) a--;
        if ( pow5(a) < answer + pow5(b) ) a++;
        if ( pow5(b) > pow5(a) - answer ) b--;
        if ( pow5(b) < pow5(a) - answer ) b++;
    }

    fprintf(stdout, "%d %d\n", a, b);
    return 0;
}