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)

// AtCoder165 C

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <math.h>
#include <assert.h>
#include <string.h>
#include <memory.h>
#include <malloc.h>
#include <stdlib.h>

// qsortで用いる比較用関数．*a<*bならaが先になる．
int compare(const void* a, const void* b) {
    return *(int*)a - *(int*)b;
}

int main() {
    int i,j;
    int x;
    long long int a, b;
    long long int tmp=0;
    scanf("%d", &x);

    a=0;
    b=-1;
    while(1){
        while(tmp < 1000000000){
            tmp = pow(a,5) - pow(b,5);
            if(x==tmp){
                printf("%lld %lld", a, b);
                return 0;
            }
            tmp = pow(a,5) + pow(b,5);
            if(x==tmp){
                printf("%lld %lld", a, b);
                return 0;
            }
            a++;
        }
        a=-b;
        b--;
    }
    return 0;
}