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.ArrayList;
import java.util.Scanner;

public class Main{

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scn= new Scanner(System.in);
		int n =scn.nextInt();
		ArrayList<Integer> al = new ArrayList<>();
		for(int i=1;i*i<=n ;i++){
			if(n%i==0){
				al.add(i);
			}
		}
	      
		for(int val : al){
			for(int i=0;i<=val;i++){
				//System.out.println(val);
				if(check(i,i-val,n)){
				      System.out.println(i+" "+(i-val));
				      return ;
				}
			}
		}
	//	System.out.println("a");

	}
	
	
	
	public  static  boolean check(long a , long b, int x){
		// System.out.println(a+" "+b);
		 long val1 = a*a*a*a*a;
		 long val2 = b*b*b*b*b;
		 if(val1-val2==(long)x){
			 return true;
		 }else{
			 return false;
		 }
	}

}