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

public class Main {

    public static void main(String[] args) {
        // write your code here
        Scanner sc = new Scanner(System.in);
        long X = sc.nextLong();
        boolean found = false;

        final long A_MAX = 1000;
        final long B_MAX = 1000;

        for(long a = 0 ; a <= A_MAX && !found ; a++){
            for(long b = -B_MAX ; b <= B_MAX && !found ; b++){
                if(pow5th(a)-pow5th(b) == X){
                    System.out.println(""+a+" "+b);
                    found = true;
                }
            }
        }
    }

    public static long pow5th(long val){
        HashMap<Long, Long> log = new HashMap<>();
        if(log.containsKey(val)){
            return log.get(val);
        }
        long result = val*val;
        result = result*result*val;
        log.put(val, result);
        return result;
    }
}