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.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        IhateFactorization solver = new IhateFactorization();
        solver.solve(1, in, out);
        out.close();
    }

    static class IhateFactorization {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            long x = in.nextLong();
            for (long a = -200; a <= 200; a++) {
                for (long b = -200; b <= 200; b++) {
                    if ((Math.pow(a, 5) - Math.pow(b, 5)) == x) {
                        out.append(String.valueOf(a) + " " + String.valueOf(b));
                        return;
                    }
                }
            }
        }

    }
}