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.*;
import java.util.stream.*;

class Main {
  public static void main(String[] args) {
    var scanner = new Scanner(System.in);
    var x = scanner.nextInt();
    // var amax = (int) Math.pow( x+0.9, 0.2 );
    var amax = 120;
    for(int a = 1; a <= amax; a++) {
      var b5 = a*a*a*a*a - x;
      if(b5 < 0) {
        var b = -fact5(-b5);
        if(b < 0) {
          System.out.println(a + " " + b);
          System.exit(0);
        }
      } else {
        var b = fact5(b5);
        if(b >= 0) {
          System.out.println(a + " " + b);
          System.exit(0);
        }
      }
    }
  }
    
  static int fact5(int x) {
    assert x >= 0;
    var r = (int) Math.pow(x + 0.9, 0.2);
    if(x != r*r*r*r*r) r = -1;
    return r;
  }
}