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

class Main {
    public static void main(final String[] args) {
        Scanner sc = new Scanner(System.in);
        int x = sc.nextInt();
        int a = 0;
        int b = 0;
        int i = 0;

        boolean flag = true;
        while (flag) {
            for (int j = 0; j <= i; j++) {
                if (Math.pow(i, 5) - Math.pow(j, 5) == x) {
                    a = i;
                    b = j;
                    flag = false;
                    break;
                }
                if (Math.pow(i, 5) - Math.pow(j * -1, 5) == x) {
                    a = i;
                    b = j * -1;
                    flag = false;
                    break;
                }
            }
            i++;
        }
        
        System.out.println(a + " " + b);
    }
}