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.HashMap;
import java.util.Map;
import java.util.Scanner;

class Main {



    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
            int x =sc.nextInt();
            long ans1 =0;
            long ans2=0;
            for(long i=-1000;i<1000;i++)
            {
                long a =i*i*i*i*i;
                for(long j=i;j<1000;j++)
                {
                    long b = j*j*j*j*j;


                    if(b-a<1000000001&&(int)(b-a)==x)
                    {
                        ans1=i;
                        ans2=j;
                    }
                }

            }
            System.out.println(ans2 +" "+ans1);

    }


}