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.*;

public class Main {
    private static final Scanner sc = new Scanner(System.in);

    private long pow(long x) {
        long r = 1;
        for (int i = 0; i < 5; ++i) {
            r *= x;
        }
        return r;
    }

    private void run() {
        long t = sc.nextLong();
        for (long x = 0; x <= 1000; ++x) {
            for (long y = -1000; y <= 1000; ++y) {
                long v = pow(x) - pow(y);
                if (v == t) {
                    System.out.println(String.format("%d %d", x, y));
                    return;
                }
            }
        }
    }

    public static void main(String[] args) {
        new Main().run();
    }
}