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.Scanner;

public class Main {

	public static void main(final String[] args) {
		Scanner sc = new Scanner(System.in);
		long X = sc.nextLong();
		sc.close();
		long a = (long)(calc((double)X, 5.0) + 0.5);
		long bb = X - (long)Math.pow(a, 5.0);
		long b = (long)(calc((double)Math.abs(bb), 5.0) + 0.5);
		// System.out.println(a + " " + bb + " " + b);
		System.out.println(a + " " + b);
	}

	static private Double calc(Double base, Double n) {
        return Math.pow(Math.E, Math.log(base)/n);
    }
}