P25610 [AtCoder] I hate Factorization
普及-
题目描述

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.

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

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.

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

输入格式

见题面 Input 部分

输出格式

见题面 Output 部分

样例输入
33
样例输出
2 -1