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 {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        long x = sc.nextInt();
        ArrayList<Long> fact5 = getFact5();
        for(int i = 0; i <= 10000; i++){
            for(int j = 0; j <= 10000; j++){
                long chk = fact5.get(i);
                long chk2 = fact5.get(j);
                if(chk + chk2 == x){
                    System.out.println(i + " " + -j);
                    return;
                }else if(chk - chk2 == x){
                    System.out.println(i + " " + j);
                    return;
                }else if(-chk + chk2 == x){
                    System.out.println(-i + " " + -j);
                    return;
                }else if(-chk - chk2 == x){
                    System.out.println(-i + " " + j);
                    return;
                }
            }
        }
    }
    
    public static ArrayList<Long> getFact5(){
        int n = 10000;
        ArrayList<Long> li = new ArrayList<Long>();
        for(int i = 0; i <= n; i++){
            long chk = (long)Math.pow(i,5);
            li.add(chk);
        }
        return li;
    }
}