CF1184A1.Heidi Learns Hashing (Easy)

Melody Pond was stolen from her parents as a newborn baby by Madame Kovarian, to become a weapon of the Silence in their crusade against the Doctor. Madame Kovarian changed Melody's name to River Song, giving her a new identity that allowed her to kill the Eleventh Doctor.

Heidi figured out that Madame Kovarian uses a very complicated hashing function in order to change the names of the babies she steals. In order to prevent this from happening to future Doctors, Heidi decided to prepare herself by learning some basic hashing techniques.

The first hashing function she designed is as follows.

Given two positive integers $(x, y)$ she defines $H(x,y):=x^2+2xy+x+1$.

Now, Heidi wonders if the function is reversible. That is, given a positive integer $r$, can you find a pair $(x, y)$ (of positive integers) such that $H(x, y) = r$?

If multiple such pairs exist, output the one with smallest possible $x$. If there is no such pair, output "NO".

梅洛迪·庞德在婴儿时期就被科瓦里安夫人从父母身边掳走，成为“寂静”组织对抗博士的武器。科瓦里安夫人为梅洛迪改名为“河 Song”（River Song），赋予她一个新身份，使其得以刺杀第十一任博士。

海蒂发现，科瓦里安夫人使用了一种极为复杂的哈希函数来更改她所掳走婴儿的名字。为了防止未来博士们遭遇同样的命运，海蒂决定提前学习一些基础的哈希技术以作准备。

她设计的第一个哈希函数定义如下：

给定两个正整数 $(x, y)$，定义 $H(x,y):=x^2+2xy+x+1$。

现在，海蒂想知道该函数是否可逆：即，对于给定的正整数 $r$，能否找到一对正整数 $(x, y)$，使得 $H(x, y) = r$？

若存在多对满足条件的 $(x, y)$，请输出其中 $x$ 值最小的一对；若不存在这样的数对，则输出 "NO"。

The first and only line contains an integer $r$ ($1 \le r \le 10^{12}$).

第一行且唯一一行包含一个整数 $r$（$1 \le r \le 10^{12}$）。

Output integers $x, y$ such that $H(x,y) = r$ and $x$ is smallest possible, or "NO" if no such pair exists.

输出整数 $x, y$，使得 $H(x,y) = r$，且 $x$ 尽可能小；若不存在这样的数对，则输出 "NO"。