Problem Statement

Shinobu picked up a positive integer $X$ in England and gave it to Alice as a present.
However, since the two of them are good friends, Alice decided to share it with her amicably.
Having many divisors feels as though it might divide their friendship as well, so the value $f(N)$ of an integer $N$ is defined as follows.

$f(N)=N-d(N)$, where $d(N)$ is the number of positive divisors of $N$

For the two of them, find all equal partitions of the integer $X$.
More precisely, find all pairs $(A,B)$ of positive integers satisfying $X=A+B$ for which $\left| f(A)-f(B)\right| $ is minimized.
If there are multiple pairs, print them in ascending order of A, following the output format below.

Input

$X$

[Constraints]
・$2\le X\le 2\times 10^6$
・$X$ is an integer.

Output

Print all pairs of integers $(A,B)$ that give the most equal partition of $X$.
Specifically, if there are $n$ pairs, print $n$ lines, each containing $A,B$ in this order, separated by a space.
The pairs must be printed in ascending order of $A$.

Sample

21

9 12
12 9

39

17 22
19 20
20 19
22 17

489

237 252
241 248
243 246
244 245
245 244
246 243
248 241
252 237