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)

import java.util.*;
import java.math.*;
public class Main {
	static long ans = 0L;
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int x = in.nextInt();
		int cur = 0; 
		while(true) {
			double p = Math.pow(cur, 5);
			p -= x;
			boolean flag = true;
			if(p < 0) {
				p *= -1;
				flag = false;
			}
			double z = Math.pow(p, 1.0 / 5);
			double newz= Math.floor(z);
			int check = (int) Math.pow(newz, 5);
			if(check ==  p) {
				if(flag == false) System.out.println(cur + " -" + (int) Math.ceil(z));
				else System.out.println(cur + " " + (int) Math.ceil(z));
				break;
			}
			cur += 1;
		}
	}
}