6542: ABC166 —— D - I hate Factorization
[Creator : ]
Description
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$
$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$
$A\ B$
Constraints
$1≤X≤10^9$
$X$ is an integer.
There exists a pair of integers $(A, B)$ satisfying the condition in Problem Statement.
$X$ is an integer.
There exists a pair of integers $(A, B)$ satisfying the condition in Problem Statement.
Sample 1 Input
33
Sample 1 Output
2 -1
For $A=2$ and $B=-1$, $A^5-B^5 = 33$.
Sample 2 Input
1
Sample 2 Output
0 -1