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: Accepted)

package main

import "fmt"

func main() {
	var x int
	fmt.Scan(&x)
	m := 120
	ns := make([]int, m)
	n5s := make(map[int]int)
	for i := 0; i < m; i++ {
		n := i * i * i * i * i
		ns[i] = n
		n5s[n] = i
	}

	result1 := 0
	result2 := 0

	for i := range ns {
		b := ns[i]
		if a, ok := n5s[b+x]; ok {
			result1, result2 = a, i
			break
		}
		if a, ok := n5s[x-b]; ok {
			result1, result2 = i, -a
			break
		}
	}

	fmt.Println(result1, result2)

}