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 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;
 
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long x = sc.nextLong();
        sc.close();
 
        int a = 0;
        long d = 1000000000;
        boolean flag = false;
        while (true) {
            long A = (long) Math.pow(a, 5);
            if (x > A) {
                if (x - A < d) {
                    d = x - A;
                } else {
                    a--;
                    break;
                }
            } else {
                if (A - x < d) {
                    d = A - x;
                } else {
                    a--;
                    break;
                }
            }
            a++;
        }
 
        int b = 0;
        if (d != 0) {
            b = (int) Math.sqrt(Math.sqrt(Math.sqrt(Math.sqrt(Math.sqrt(d)))));
        }
        System.out.println(a + " " + (-b));
    }
}