AtCoder Beginner Contest 166
D
I hate Factorization
AtCoder
⌀ 694
原题
← CE →
翻译中…

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

翻译中…

样例

Input #1
33
Output #1
2 -1
For $A=2$ and $B=-1$, $A^5-B^5 = 33$.
Input #2
1
Output #2
0 -1
题目信息
题号
abc166_d
时间限制
2 s
内存限制
1024 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。