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);
        int x = sc.nextInt();
        long a = 0, b = 0;
        Map<Long, Long> map = new HashMap<Long, Long>();
        map.put(0L, 0L);
        for (long i = 1; i < 1000; i++) {
            long a5 = (long) Math.pow(i, 5);
            if(a5 < x){
                if(map.containsKey(x - a5)){
                    a = i;
                    b = - map.get(x-a5);
                    break;
                }
                map.put(a5, i);
            }else{
                if(map.containsKey(a5 - x)){
                    a = i;
                    b = map.get(a5 - x);
                    break;
                }
                map.put(a5, i);
            }
        }
        System.out.println(a + " " + b);
        sc.close();

    }

}