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: Time Limit Exceeded)

import java.util.HashSet;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		long target = sc.nextLong();

		//		long l =100000*100000;
		//		System.out.println(l);
		HashSet<Integer>A=new HashSet<Integer>();
		HashSet<Integer>B=new HashSet<Integer>();
		for(int i =-1;i<100000;i++) {
			A.add(i);
			B.add(i);
		}

		for (long i:A) {
			for (long j:B) {
				long tmp = (i * i * i * i * i) - (j * j * j * j * j);
				if (tmp == target) {
					System.out.println(i + " " + j);
					return;
				}
			}
		}

		System.out.println();

	}
}