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 int
  fmt.Scanf("%d\n", &X)
  
  for b := 0; ; b++ {
    b5 := b * b * b * b * b
    aX := X + b5
    for i := 1; i <= aX; i++ {
      if aX % i == 0 && i*i*i*i*i == aX {
        fmt.Println(i, b)
        return
      }
    }
    
    neg := 0
    sX := X - b5
    if sX < 0 {
      neg = 1
      sX *= -1
    }
    for i := 1; i <= sX; i++ {
      if sX % i == 0 && i*i*i*i*i == sX {
        if neg == 0 {
        	fmt.Println(i, -b)
        }else{
          fmt.Println(-i, -b)
        }
        return
      }
    }
  }
}