Problem: 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

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

Examples

Input

33


Output

2 -1


Input

1


Output

0 -1

Solution (in JAVA):

Solution:
import java.io.InputStream;
import java.io.PrintStream;
import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    resolve(System.in, System.out);
  }

  static void resolve(InputStream is, PrintStream pw) {
    Scanner sc = new Scanner(is);
    long x = Integer.parseInt(sc.next());
    for (long a = 0; ; a++) {
      long l5 = (long) Math.pow(a, 5);
      long idealB5 = l5 - x;
      if (idealB5 == 0) {
        pw.println(a + " " + 0);
      }
      if (idealB5 < 0) {
        long b = (long) Math.pow(-idealB5, 1d / 5d);
        if ((long) Math.pow(b, 5) == -idealB5) {
          pw.println(a + " " + -b);
          return;
        }
      } else {
        long b = (long) Math.pow(idealB5, 1d / 5d);
        if ((long) Math.pow(b, 5) == idealB5) {
          pw.println(a + " " + b);
          return;
        }
      }
    }
  }
}