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

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long x = sc.nextLong();
        for (long a=0;a<1000;a++) {
            for (long b=0;b<1000;b++) {
                if (a*a*a*a*a+b*b*b*b*b == x) {
                    System.out.println(a + " " + (-b));
                    return;
                } else if (a*a*a*a*a-b*b*b*b*b == x) {
                    System.out.println(a + " " + b);
                    return;
                } else if (-a*a*a*a*a+b*b*b*b*b == x) {
                    System.out.println((-a) + " " + (-b));
                    return;
                } else if (-a*a*a*a*a-b*b*b*b*b == x) {
                    System.out.println((-a) + " " + b);
                    return;
                }
            }
        }

    }
}