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 {

  public static void main(String[] args) {

    Scanner scan = new Scanner(System.in);

    long x = scan.nextLong();

    int h = (int) Math.pow(x, 0.2);

    for (int i = -h + 1; i < h; i++) {
      double a = Math.pow(Math.pow(i, 5) + x, 0.2);
      String s = Double.toString(a);
      int len = s.length();
      int dot = s.indexOf('.');
      int j = dot + 1;
      while (true) {
        if (s.charAt(j) != '0') {
          break;
        }
        if ((j == len - 1) || (j == dot + 13)) {
          System.out.println((int) a + " " + i);
          return;
        }
        j++;
      }
    }

  }

}