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);
        long X = sc.nextLong();
        sc.close();

        int A = -118;
        int B = -119;
        boolean isOK = false;
        for (; A <= 119; A++) {
            if (A == 0) {
                System.out.println("");
            }
            B = -119;
            for (; B <= 119; B++) {
                if (B == 0) {
                    System.out.println("");
                }
                long result = (long) (Math.pow((double) A, 5) - Math.pow((double) B, 5));
                if (result == X) {
                    isOK = true;
                    break;
                }
            }
            if (isOK) {
                break;
            }
        }

        System.out.println(String.valueOf(A) + " " + String.valueOf(B));
    }

}