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.HashMap;
import java.util.Map;
import java.util.Scanner;

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

    private void run() {
        Scanner scanner = new Scanner(System.in);
        long X = scanner.nextLong();
        Map<Long, Pair> map = new HashMap<>();
        for (long i = -600; i <= 600; i++) {
            long ii = i * i * i * i * i;
            for (long j = -600; j <= 600; j++) {
                map.put(ii - j * j * j * j * j, new Pair(i, j));
            }
        }
        Pair pair = map.getOrDefault(X, new Pair(-9999, -9999));
        if(pair.a == -9999) throw new RuntimeException("aaa");
        System.out.println(pair.a);
        System.out.println(pair.b);
    }

    class Pair {
        long a;
        long b;

        Pair(long a, long b) {
            this.a = a;
            this.b = b;
        }
    }
}