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: Wrong Answer)


#include <stdio.h>
#include <stdlib.h>
#include <string.h>


typedef struct
{
    int height;
    int connect;
    int* connctTarget;
}Info;



int main()
{
    int i, j, k, m;

    char str[1000];
    fgets(str, sizeof(str), stdin);
    int Num = atoi(str);

    int A = 0;
    int B = 0;

    int find = 0;
    for (B = -10000;B < 10000;B++)
    {
        int B5 = B * B * B * B * B;

        int hoge = Num + B5;

        for (A = -10000;A < 10000;A++)
        {
            int A5 = A * A * A * A * A;
            if (hoge == A5)
            {
                find = 1;
                break;
            }
        }
        if (find == 1) break;
    }

     printf("%d %d\n", A,B);


    return 0;
}