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

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int x = in.nextInt();
        // 200^5 - 199^5 = 7920399001 > 10^9 であることから、200まで全探索すればOKっしょ、と考えてたら甘かったが、よくわからん🙉
        for(long a=-200; a<=200; a++) {
            for(long b=-200; b<=200; b++) {
                long a5 = a*a*a*a*a;
                long b5 = b*b*b*b*b;
                if(x==a5-b5) {
                    System.out.print(a);
                    System.out.print(" ");
                    System.out.println(b);
                    return;
                }
            }
        }
        throw new RuntimeException("could not find");
    }
}