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)

// これ気づかんかった、もっと冷静になるべきだった
// Xの上限が10^9なのだがこれがヒント
//
// ...らしいんだけど、だからなんでここにたどり着けるのか一切わからん

package main

import (
	"fmt"
	"math"
)

func main() {
	var X int
	fmt.Scan(&X)
	for i := -300; i <= 300; i++ {
		for j := -300; j <= 300; j++ {
			if math.Pow(float64(i), float64(5))-math.Pow(float64(j), float64(5)) == float64(X) {
				fmt.Println(i, j)
				return
			}
		}
	}
}