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();
      	int ansA = 0;
      	int ansB = 0;
        for(int A=0;A<=1000;A++){
          for(int B=-1000;B<=1000;B++){
            double res = Math.pow(A, 5) - Math.pow(B, 5);
            if(res == X){
              ansA = A;
              ansB = B;
              break;
            }
            }
        }
      	
 	    System.out.println(ansA);
      	System.out.println(ansB);
    }
}