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{

    Scanner sc = new Scanner(System.in);

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

    void run() {

        long x = sc.nextLong();

//        System.out.println((long)Math.pow(1000, 5));
//        System.out.print((long)Math.pow(1001, 5));


        for (int a=-1000; a<=1000; a++) {
            for (int b=-1000; b<=1000; b++) {
                long calc = (long)Math.pow(a, 5) - (long)Math.pow(b, 5);
                if (calc == x) {
                    System.out.print(a + " ");
                    System.out.print(b);
                    return;
                }
            }
        }

    }
}