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.*;
import java.io.*;
public class Main
{
    public static void main(String args[])throws Exception
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw=new PrintWriter(System.out);
        String str[]=br.readLine().split(" ");
        long x=Long.parseLong(str[0]);
        long pow5[]=new long[6201];
        for(int i=0;i<=6200;i++)
        pow5[i]=(long)Math.pow(i,5);
        int a=-1,b=10000;
        for(int i=0;i<=6200;i++)
        {
            a=i;
            b=10000;
            for(int j=0;j<=6200;j++)
            {
                if(pow5[i]-pow5[j]==x)
                {
                    b=j;
                    break;
                }
                else if(pow5[i]+pow5[j]==x)
                {
                    b=-j;
                    break;
                }
            }
            if(b!=10000)
            break;
        }
        pw.println(a+" "+b);
        pw.flush();
        pw.close();
    }
}