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 sc = new Scanner(System.in);
    long x = sc.nextLong();
    long num = -3000l;
    long b[] = new long[6000];
    long bb[] = new long[6000];
    long a[] = new long[6000];
    long aa[] = new long[6000];
    for(int i = 0;i<6000;i++){
      long gojo = num * num * num * num * num;
      b[i] = gojo;
      bb[i] = num;
      a[i] = gojo;
      aa[i] = num;
      num++;
    }
    for(int i = 0;i<6000;i++){
      for(int j = 0;j<6000;j++){
        if(a[j] - b[i] == x){
          System.out.println(aa[j] + " " + bb[i]);
          return;
        }
      }
    }
  }
}