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);
        String line = sc.nextLine();
        long x = Long.parseLong(line);
        
        int a = 0;
        int b = 0;
        
        boolean flag = true;
        for(a = 1; a < 1000; a++)
        {
            
            for(b = -999; b < a; b++)
            {
                long aa = (long)Math.pow(a,5);
                long bb = (long)Math.pow(b,5);
                long result = aa - bb;
                
                if(result == x)
                {
                    flag = false;
                    break;
                }
            }
            if(flag == false)
            {
                break;
            }
            
        }
        
        System.out.println(a + " " + b);
    }
}