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 Go (1.14.1) (judge verdict: Time Limit Exceeded)

package main

import "fmt"

func main() {
	var x, a, b int64
	fmt.Scan(&x)

	for a = -x; a <= x; a++ {
		for b = -x; b <= x; b++ {
			if a == b || x%(a-b) != 0 {
				continue
			} else if (a*a*a*a*a - b*b*b*b*b) == x {
				fmt.Println(a, b)
				return
			}
		}
	}
}