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{
    static int num = 1000*2+1;
    static int max = 1000;
    static long[][] dp = new long[num+1][num+1];
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        Long x = sc.nextLong();
        for(int i=0;i<=max*2;i++){
            long it = i-max;
            long a = pow5(it);
            for(int j=0;j<=max*2;j++){
                long jt = j-max;
                long b = pow5(jt);
                if(x==(a-b)){
                    System.out.println(it + " " + jt);
                    return;
                }
                else if(x==(b-a)){
                    System.out.println(jt + " " + it);
                    return;
                }
            }
        }

    }

    private static Long pow5(Long x) {
        return x*x*x*x*x;        
    }
}