I. Inverse Sum
time limit per test
2 s
memory limit per test
1024 megabytes
input
standard input
output
standard output

Given an integer $$$n \gt 1$$$, and the equation: $$$$$$ \frac{1}{n}=\frac{1}{a}+ \frac{1}{b}$$$$$$ Find two distinct positive integers $$$a,b$$$ which both satisfy the above equation, and have a minimal sum $$$a+b$$$.

Input
  • The only line of input consists of one integer $$$n$$$ ($$$1 \lt n \le 10^8$$$) — the number for the left hand side of the equation.
Output

Output the best choices for $$$a$$$ and $$$b$$$ in ascending order.

Examples
Input
4
Output
6 12
Input
107
Output
108 11556
Input
999999
Output
1998000 2002000
Input
1000000
Output
1800000 2250000