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

public class Main{
  public static void main(String[] args){
    Scanner scan = new Scanner(System.in);
    long n = scan.nextLong();
    long [] b = new long[241];
    long [] c = new long[241];

    for (int j=-120;j<121;j++){
      long gg = fast(j,5);
      b[j+120] = gg;
      c[j+120] = gg;
    }

    for(int i=240;i>=0;i--){
      for (int j = i-1; j>=0;j--){
        if (b[i] - c[j] == n){
          int a1 = i-120;
          int a2 = j-120;
          System.out.println(a1 + " " + a2);
          return;
        }
      }
    }

  }

  static long fast(int a, int b){
    long ans = 1;
    long base = a;
    while (b !=  0){
      if ((b & 1) == 1){
        ans *= base;
      }
      base = base*base;
      b >>= 1;
    }
    return ans;
  }
}