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;

/**
 * Main
 */
public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        long X = sc.nextLong();
        sc.close();
        int min = (int)(-1*Math.pow(10, 3));
        int max = (int)(Math.pow(10, 3));
    
        for(int i= min; i < max; i++) {
            for(int j=i-1; j>=min; j--){
                long A = (long)(Math.pow(i, 5));
                long B = (long)(Math.pow(j, 5));
                if(A - B == X){
                    System.out.println(i + " " + j);
                    return;
                }
                if(i-j > X){
                    break;
                }
            }
        }
    }
}