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

import java.util.*;

public class Main {

    public static void main(String args[]) {

        // 入力
        Scanner sc = new Scanner(System.in);
        int x = Integer.parseInt(sc.next());
        sc.close();

        // 主処理
        List<Integer> list = new ArrayList<>();
        final int MOD = 1000000007;
        for (int i = 0; Math.pow(i, 5) <= MOD; i++) {
            int num = (int) Math.pow(i, 5);
            list.add(num);
        }

        String[] nums = new String[2];
        for (int i = 0; i < list.size(); i++) {
            for (int j = 0; j < list.size(); j++) {
                int left = list.get(i);
                int right = list.get(j);
                if (left + right == x) {
                    nums[0] = Integer.toString(i);
                    nums[1] = Integer.toString(j * -1);
                }
                if (left - right == x) {
                    nums[0] = Integer.toString(i);
                    nums[1] = Integer.toString(j);
                }
            }
        }
        String result = String.join(" ", nums);

        // 出力
        System.out.println(result);
    }
}