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.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		
		int x = stdIn.nextInt();
		
		//ａ⁵－ｂ⁵＝(ａ－ｂ)(ａ⁴＋ａ³ｂ＋ａ²ｂ²＋ａｂ³＋ｂ⁴)
		if(x==1) {
			System.out.println(0+" "+(-1));
			return;
		}
		
		
		for(int i = 0; Math.pow(i, 5)<x; i++) {
			
			int b = Math.abs((int)Math.pow(i, 5)-x);
			
			for(int j = 0; Math.pow(j, 5)<x; j++) {
				if(b==(int)Math.pow(j, 5)) {
					if(Math.pow(i, 5)<x) {
						System.out.println(i+" "+(-j));
						return;
					}else {
						System.out.println(i+" "+j);
						return;
					}
				}
			}
			
			
		}
		
		
		
		
	}

}