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.io.BufferedInputStream;
import java.io.IOException;
import java.util.HashMap;
import java.util.Scanner;

/**
 * Created by Harry on 5/3/20.
 */
public class Main {
    public static void main(String[] args) throws IOException {
        Scanner scanner = new Scanner(new BufferedInputStream(System.in));
        int x = scanner.nextInt();
        HashMap<Integer, Long> map = new HashMap<>();
        for(int i=-1000; i<=1000; i++){
            map.put(i, (long)Math.pow(i, 5));
        }
        calc:
        for(int cur=-1000; cur<=1000; cur++){
            for(int other: map.keySet()){
                if(map.get(cur)-map.get(other)==x){
                    System.out.println(cur+" "+other);
                    break calc;
                }
            }
        }
    }
}