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)throws Exception{
		Scanner stdIn=new Scanner(System.in);
		int X=stdIn.nextInt();
		long key[]=new long[101];
		for(long i=0;i<=100;i++){
			key[(int)i]=(long) Math.pow(i,5);
		}
		for(int i=0;i<100;i++){
			for(int j=0;j<100;j++){
				if(key[i]-key[j]==X){
					System.out.println(i);
					System.out.println(j);
					System.exit(0);
				}
				if(key[i]+key[j]==X){
					System.out.println(i);
					System.out.println(-j);
					System.exit(0);
				}
			}
		}
	}
}