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 Java (OpenJDK 11.0.6) (judge verdict: Time Limit Exceeded)

import java.util.*;
import java.math.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        BigInteger x = new BigInteger(String.valueOf(sc.nextBigInteger()));

        BigInteger array[] = new BigInteger[20002];

        for (int i = 0; i <= 10000; i++) {
            array[i] = BigInteger.valueOf(i * i * i * i * i);
        }

        for (int i = 0; i <= 10000; i++) {
            array[i + 10001] = BigInteger.valueOf(-i * i * i * i * i);
        }

        for (int i = 0; i < 20002; i++) {
            for (int j = 0; j < 20002; j++) {
                if ((array[i].subtract(array[j])).compareTo(x) == 0) {
                    if (i >= 10001) {
                        i = -i + 10001;
                    }

                    if (j >= 10001) {
                        j = -j + 10001;
                    }

                    System.out.println(String.valueOf(i) + " " + String.valueOf(j));
                    return;
                }

            }
        }




        sc.close();
    }

}