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 pow5(x int) int64 {
	res := int64(1)
	for i := 0; i < 5; i++ {
		res *= int64(x)
	}
	return res
}

func main() {
	var x int64
	fmt.Scan(&x)
	for a := 0; a <= 500; a++ {
		for b := -500; b <= 500; b++ {
			if pow5(a)-pow5(b) == x {
				fmt.Println(a, b)
				return
			}
		}
	}
}