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();
        ArrayList<Long> factors = new ArrayList<>();
        factors.add((long)1);
        for (long i = 2; i <= 130; i++) {
            if (x % Math.abs(i) == 0) factors.add(i);
        }
        long a = -1; long b = -1;
        for (Long dif: factors) {
            for (long lo = -130; lo + dif < 131; lo++) {
                if (Math.pow(lo + dif, 5) - Math.pow(lo, 5) == x) {
                    a = lo + dif; b = lo;
                }
            }

        }
        System.out.println(a + " " + b);
    }


}