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

public class Main {

  static long x;
  
  public static void main(String[] args) throws Exception {
    
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    String[] in = br.readLine().split(" ");
    x = Long.parseLong(in[0]);

    br.close();

    long i = -1000, j = -1000;
    boolean ok = false;

    for(i = -1000; i <= 1000; i++){
      for(j = -1000; j <= 1000; j++){
        if(gj(i) - gj(j) == x) {
          ok = true;
          break;
        }
      }
      if(ok) break;
    }

    PrintWriter out = new PrintWriter(System.out);
    out.println(i + " " + j);
    out.flush();

  }

  static long gj(long a){
    return a * a * a * a * a;
  }
}