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.io.BufferedReader;
import java.math.BigInteger;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        int x = cin.nextInt();
        for(int i = -1000;i <= 1000;i++){
            for(int j = -1000;j <= 1000;j++){
                BigInteger t = BigInteger.valueOf(i);
                BigInteger m = BigInteger.valueOf(j);
                BigInteger cur = t.pow(5).subtract(m.pow(5));
                if(cur.equals(BigInteger.valueOf((int)x))){
                    System.out.println(i + " " + j);return ;
                }
            }
        }
//        for(int i = 100;i <= 10000;i++){
//            BigInteger x = BigInteger.valueOf(i);
//            BigInteger t = BigInteger.valueOf(i - 1);
//            BigInteger cur = x.pow(5);
//            BigInteger cnt = t.pow(5);
//            BigInteger ans = cur.subtract(cnt);
//            ans = ans.subtract(BigInteger.valueOf((int)1e9));
//            System.out.println(i + " " + ans);
//        }
    }
}