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

public class Main {

    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        
        long x = Long.parseLong(sc.next());
        
        long[] d = new long[6209];
        for(int i = 0; i < 6209; i++){
            long l = i;
            d[i] = l*l*l*l*l;
        }
        
        long a = 0;
        long b = 0;
        for(int i = 0; i < 6209; i++){
            int left = -1;
            int right = 6208;
            long c = Math.abs(d[i] - x);
            while(right-left > 1){
                int mid = (left + right) / 2;
                if(d[mid] > c){
                    right = mid;
                }else{
                    left = mid;
                }
            }
            if(d[i] - d[left] == x){
                a = i;
                b = left;
                break;
            }
            if(d[i] + d[left] == x){
                a = i;
                b = -left;
                break;
            }
        }
        System.out.println(a + " " + b);
    }
}