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;
import java.util.ArrayList;
import java.math.*;

public class Main {
    private static final int MAXN = 212;

    public static void main(String[] args) {
        var scanner = new Scanner(System.in);
        int x = scanner.nextInt();

        var data = new Long[2 * MAXN + 1];

        for (int i = -MAXN; i <= MAXN; ++i) {
            data[i + MAXN] = (long)Math.pow(i, 5);
        }

        for (int i = 0; i <= 2 * MAXN; ++i) {
            for (int j = 0; j <= 2 * MAXN; ++j) {
                if (data[i] - data[j] == x) {
                    System.out.printf("%d %d\n", i - MAXN, j - MAXN);
                    return;
                }
            }
        }
    }
}