Problem:
Score : 400 points

Problem Statement

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

Sample Input 1

33

Sample Output 1

2 -1

For A=2 and B=-1, A^5-B^5 = 33.

Sample Input 2

1

Sample Output 2

0 -1

Solution in Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

//D
import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int x = sc.nextInt();
		
		for(int i = 0; i < 10000; i++) {
			Random rand = new Random();
			int a = rand.nextInt(50);
			int b = rand.nextInt(50) - 10000;
			int a_tmp = a * a * a * a * a;
			int b_tmp = b * b * b * b * b;
			if (a_tmp == b_tmp) {
				System.out.print(a);
				System.out.print(" ");
				System.out.print(b);
				break;
			}
		}
	}
}