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.math.BigDecimal;
import java.sql.Array;
import java.util.*;
public class Main {
	public static void main(String[] args){
      	
		Scanner sc = new Scanner(System.in);
		int X = sc.nextInt();
		boolean good = true;
		for (long i = -100; i <= 100; i++) {
			for (long j = -100; j <= 100; j++) {
				if((i*i*i*i*i)-(j*j*j*j*j)==X){
					System.out.println(i+" "+j);
					good = false;
					break;
				}		
			}
			if(!good){
				break;
			}
		}

		if(good){
		for (long i = 64; i <= 128; i++) {
			for (long j = 64; j <= 128; j++) {
				if((i*i*i*i*i)-(j*j*j*j*j)==X){
					System.out.println(i+" "+j);
					good =false;
					break;
				}		
			}
			if(!good){
				break;
			}
		}
		}
		if(good){
		for (long i = -128; i <= -64; i++) {
			for (long j = -128; j <= -64; j++) {
				if((i*i*i*i*i)-(j*j*j*j*j)==X){
					System.out.println(i+" "+j);
					good = false;
					break;
				}		
			}
			if(!good){
				break;
			}
		}
		}
		sc.close();
    }	
		
}