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.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int X = scanner.nextInt();
        scanner.close();

        for (int i = Integer.MIN_VALUE; i < X; i++) {
            double temp = Math.abs(Math.pow(i, 5) - X);
            double b = Math.pow(temp, 0.2);

            if ((b == Math.floor(b)) && !Double.isInfinite(b)) {
                int B = (int) b;
                if (Math.pow(i, 5) - Math.pow(B, 5) == X) {
                    System.out.println(i + " " + B);
                    return;
                } else {
                    System.out.println(i + " " + (-1) * B);
                    return;
                }
            }

        }

    }
}