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.*;

public class Main{
    public static void main(String[] args)throws Exception{
        
        Scanner sc = new Scanner(System.in);

        long x = sc.nextInt();

        long memx=0;
        long memy=0;
        for(long i=1; i<=200; i++){
            boolean flag = false;
            for(long j= -200; j<=200; j++){
                if(i*i*i*i*i - j*j*j*j*j == x){
                    memx = i;
                    memy = j;
                    flag = true;
                    break;
                }
            }
            if(flag)break;
        }
        System.out.println(memx + " " + memy);
    }
}