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 s = new Scanner(System.in);
        double x = Double.parseDouble(s.next());
        
        double temp = 0;
        double h = 0;
        double a,b = 0;

        while(Math.pow(temp, 5) < x) {
            temp += 1;
        }

        if ((Math.pow(temp, 5) - x) > (x - Math.pow(temp-1, 5))) temp -= 1;

        h = Math.pow(temp, 5) - x;

        if (Math.pow(temp, 5) - x == 0) {
            a = temp;
            b = 0;
        } else if (Math.pow(temp, 5) - x > 0) {
            a = temp;
            while (Math.pow(b, 5) < h) b += 1;
        } else {
            a = temp;
            while (Math.pow(b, 5) > h) b -= 1;
        }

        System.out.println((int)a + " " + (int)b);
    }
}