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 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;

public class Main{
//public class abc166_d{
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);
		long X = scan.nextLong();
		long temp = X;

		for(long i=X-1;i>0;i--){
			if(X % i == 0){
				temp = i;
				break;
			}
		}
		boolean flag = true;

		for(long i=0; i<(X/temp); i++){
			long j = i -temp;
			double cal = Math.pow(i,4) +(Math.pow(i,3) * j ) + (Math.pow(i,2)*Math.pow(j,2)) + (i*Math.pow(j,3)) + Math.pow(j,4);
			if( (X/temp) == cal){
				System.out.println(i +" " +j);
				flag = false;
				break;
			}
		}

		if(flag){
			for(long i=0; i > (-1 * (X/temp)); i--){
				long j = i -temp;
				double cal = Math.pow(i,4) +(Math.pow(i,3) * j ) + (Math.pow(i,2)*Math.pow(j,2)) + (i*Math.pow(j,3)) + Math.pow(j,4);
				if( (X/temp) == cal){
					System.out.println(i +" " +j);
					break;
				}
			}
		}
	}

}