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 s = new Scanner(System.in);
        long x = Long.parseLong(s.next());
        // double loggg = Math.log(5.0);

        for (long i = 1;;i++) {
            long expect5 = i*i*i*i*i - x;
            if (expect5 > 0) {
                for (long j = 1;;j++) {
                    if (j*j*j*j*j < expect5) {
                        continue;
                    } else if (j*j*j*j*j == expect5) {
                        System.out.println("" + i + " " + j);
                        return;
                    } else {
                        break;
                    }
                }
            } else if (expect5 < 0) {
                for (long j = -1;;j--) {
                    if (j*j*j*j*j > expect5) {
                        continue;
                    } else if (j*j*j*j*j == expect5) {
                        System.out.println("" + i + " " + j);
                        return;
                    } else {
                        break;
                    }
                }
            } else {
                System.out.println("" + i + " " + 0);
                return;
            }
        }
    }
}