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 s=new Scanner(System.in);
		
		long x=s.nextLong();
		
		long a1=0;
		long a2=0;
		
		for(int i=0;i<=100;i++)
		{
			for(int j=0;j<=100;j++)
			{
				if(power(i)+power(j)==x)
				{
					a1=i;
					a2=-1*j;
				}
			}
		}
		
		System.out.println(a1+" "+a2);
		
	}
	
	public static long power(long a)
	{
		long res=1;
		
		for(int i=0;i<5;i++)
		{
			res=res*a;
		}
		
		return res;
	}
	
}