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 <stdio.h>

int sa(int a,int b) {
    return a * a * a * a * a - b * b * b * b * b;
}

int main()
{

    long x;
    scanf("%ld", &x);

if(x==1){
    printf("0 -1\n");
    return 0;
}


    int i=0;
    int dis;
    int DIS;
    for (i = -1; i < 100; i++)
    {

        if (sa(i - 1, 0) < x && x < sa(i, 0))
        {
            dis = x - sa(i - 1, 0);
            DIS = sa(i, 0) - x;
            break;
        }
    }
    int SA[10000];
    int jr = sa(10000, 0);

    for (int j = 0; j < 10000; j++)
    {
        SA[j] = jr - sa(10000, j) ;
       // printf("%d\n", SA[j]);
        if(SA[j]==dis){
            printf("%d %d", i - 1, -j);
            break;
        }
        if (SA[j] == DIS){
            printf("%d %d", i , j);
            break;
        }
    }

  

  

    printf("\n");
}