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.*;
class Main{
  public static void main(String args[]){
    Scanner sc = new Scanner(System.in);
    long x = sc.nextLong();
    long a=0,b=0;
    for(;;b++){
      long bf = five(b);
      a = isfive(bf+x);
      if(a!=-1){break;}
      a = isfive(-bf+x);
      if(a!=-1){b*=-1;break;}
    }
    pl(a+" "+b);
  }

  public static long five(long a){
    long k=a*a;
    return k*k*a;
  }

  public static long isfive(long a){
    for(long i=0;;i++){
      long k=five(i);
      if(k==a){
        return i;
      }else if(k>a){
        break;
      }
    }
    return -1;
  }

  public static void pr(String str){
    System.out.print(str);
  }
  public static void pl(String str){
    System.out.println(str);
  }
}