Source

This problem is adapted from Long Long OJ. All rights reserved.

Attention

The time limit for this problem is 0.1 seconds, and the memory limit is 8 MB.

Problem Description

Find all pairs $(a,b)$ (where $a> 0, b> 0$) such that $ab+a+b=N$, and output them in ascending order of $a$ (if $a$ is the same, output in ascending order of $b$).

If no such pairs $(a,b)$ exist, output No.

Input Format

A single line containing an integer $N$.

Output Format

Output all pairs $(a,b)$ satisfying $ab+a+b=N$ in ascending order of $a$ (if $a$ is the same, output in ascending order of $b$).

If no such pairs $(a,b)$ exist, output No.

Samples

11

1 5
2 3
3 2
5 1

6

No

Data Range

$1 \le N \le 10^{12}$.