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

class Main{
    public Main(){
        Scanner SC = new Scanner(System.in);
        long X = Long.parseLong(SC.next());

        ArrayList<Long> factor = new ArrayList<Long>();

        for(long i=1;i*i<=X;i++){
            if(X % i == 0){
                factor.add(i);
                factor.add(X/i);
            }
        }

        long A, B = 0;
        while(true){
            for(long f : factor){
                A = f + B;
                if(A*A*A*A*A-B*B*B*B*B == X){
                    System.out.println(A + " " + B);
                    return;
                }
                A = f - B;
                if(A*A*A*A*A+B*B*B*B*B == X){
                    System.out.println(A + " " + -1*B);
                    return;
                }
            }
            B++;
        }
    }

    public static void main(String args[]){
        Main main = new Main();
    }
}