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:
//make sure to make new file!
import java.io.*;
import java.util.*;

public class Main{
   
   public static void main(String[] args)throws IOException{
      BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
      PrintWriter out = new PrintWriter(System.out);
      
      long n = Long.parseLong(f.readLine());
      
      HashMap<Long,Long> hmap = new HashMap<Long,Long>();
      
      long MAXN = 200;
      for(long k = 0; k < MAXN; k++){
         hmap.put(k*k*k*k*k,k);
      }
      
      for(long k = 0; k < MAXN; k++){
         long a = k*k*k*k*k;
         long b5 = a-n;
         long b = -1;
         boolean neg = b5 < 0;
         b5 = Math.max(b5,-1*b5);
         if(hmap.containsKey(b5)){
            b = hmap.get(b5);
         } else {
            continue;
         }
         
         if(neg){
            b *= -1;
         }
         
         out.println(k + " " + b);
         break;
      }
      
      
      
      
      
      
      
      
      
      
      out.close();
   }
   
      
}