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.math.BigDecimal;
import java.util.Scanner;

public class Main {

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

        BigDecimal X = BigDecimal.valueOf(x);
        for (int a = -200; a <= 200; a++) {
            BigDecimal A = BigDecimal.valueOf(a);
            BigDecimal A5 = A.pow(5);

            for (int b = -200; b <= 200; b++) {
                BigDecimal B = BigDecimal.valueOf(b);
                BigDecimal B5 = B.pow(5);
                
                if(A5.subtract(B5).equals(X)) {
                    System.out.println(String.format("%d %d\n", a, b));
                    return;
                }
            }
        }
    }
}