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.*;
import java.util.stream.*;

class Main {
    public static void main(String[] args) {
        var scanner = new Scanner(System.in);
        var x = scanner.nextLong();

        var amax = (long) Math.pow( x+0.9, 0.2 );
        for(long a = 1; a <= amax; a++) {
            var b = longPow(x - a*a*a*a*a, 0.2);
            // System.out.println("# " + a + " " + (-b));
            if(a*a*a*a*a + b*b*b*b*b == x) {
                System.out.println(a + " " + (-b));
                System.exit(0);
            }
        }

        var bmax = (long) Math.pow( (x/5)+0.9, 0.25 );
        for(long b = 0; b <= bmax; b++) {
            var a = longPow(x + b*b*b*b*b, 0.2);
            // System.out.println("% " + a + " " + b);
            if(a*a*a*a*a - b*b*b*b*b == x) {
                System.out.println(a + " " + b);
                System.exit(0);
            }
        }
    }

    static long longPow(long x, double p) {
        assert x >= 0;
        return (long) Math.pow(x+0.9, p);
    }
}