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 scanner = new Scanner(System.in);
        long x = scanner.nextLong();
        long[] power = new long[1001];
        power[0] = 0;
        for (int i = 1; i <= 1000; ++i) {
            power[i] = ((long)i) * i * i * i * i;
        }
        for (int a = -1000; a <= 1000; ++a) {
            for (int b = -1000; b <= 1000; ++b) {
                long powerA = power[Math.abs(a)];
                if (a < 0) {
                    powerA *= -1L;
                }
                long powerB = power[Math.abs(b)];
                if (b < 0) {
                    powerB *= -1L;
                }
                if (powerA - powerB == x) {
                    System.out.println(a + " " + b);
                    return;
                }
            }
        }
    }
}