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;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long x = sc.nextLong();
        outer: for (long a = 1000; a > 0; a--) {
            for (long b = a; b > -1000; b--) {
                if (pow(a, 5) - pow(b, 5) == x) {
                    System.out.printf("%d %d\n", a, b);
                    break outer;
                }
            }
        }
    }
    static  long pow(long num, long times) {
        long result = 1;
        for (long i = 0; i < times; i++) {
            result *=  num;
        }
        return result;
    }
}