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 static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long x = sc.nextLong();
        long S = -200L;
        long L = 200L;
        long a = 0L;
        long b = 0L;

        for(long i = S;i <= L;i++){
            for(long j = S;j <= L;j++){
                long A = i*i*i*i*i;
                long B = j*j*j*j*j;
                if(x == A-B){
                    a = i;
                    b = j;
                    break;
                }
            }
        }

        System.out.println(a+" "+b);
    }
}