2497: AtCoder166 D - I hate Factorization

Memory Limit:128 MB Time Limit:1.000 S
Judge Style:Text Compare Creator:
Submit:1 Solved:0

Description

Problem Statement

Give a pair of integers (A,B) such that A5B5=X. It is guaranteed that there exists such a pair for the given integer X.

Constraints

  • 1X109
  • 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 Copy

33

Sample Output Copy

2 -1