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) {
        @SuppressWarnings("resource")
        Scanner sc = new Scanner(System.in);
        int x = sc.nextInt();
        for (int i = 1 ; i * i <= x ; i++) {
            if (x % i == 0) {
                int n = i;
                int m = x / i;
                for (int j = -50000 ; j < 50000; j++ ) {
                    int a = j;
                    int b = a - n;
                    if ((long) (a * a * a *a + a * a * a * b + a* a* b * b + a * b * b * b + b * b * b * b) == m) {
                        System.out.println(a + " " + b);
                        return;
                    }
                }
            }
        }
    }

}