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

public class Main {
    static Scanner sc = new Scanner(System.in);
    static long x = sc.nextLong();
    //65まで持っていればいい
    //65の5乗が10の9乗を超えとこ
    static long num[] = new long[123];

    public static void main(String[] args) {
        int i = -1;
        while (++i < num.length){
            if (i == 0) {
                num[0] = 0;
                continue;
            }
            num[i] = (int)Math.pow(i, 5);
            System.out.println(num[i]);
        }
        for (int j = 0; j < num.length; j++){
            for (int k = 0; k < num.length; k++){
                if (num[j] - num[k] == x){
                    System.out.println(j + " " + k);
                    return;
                } else if ( - num[j] - num[k] == x){
                    System.out.println(-j + " " + k);
                    return;
                } else if ( num[j] + num[k] == x){
                    System.out.println(j + " " +  -k);
                    return;
                }
            }
        }
    }
}