#### Consecutive Divider

**Author: ** Jisan

Problem Setter:Jisan Shaikh

Mr. Tom the General secretory of “BSMRSTU Programming Club” is in danger. He is in a seminar. A miscreant asks him a question. But Alas! He doesn’t know the answer. As he is the General Secretory of “BSMRSTU Programming Club” it’s the question of dignity of our “BSMRSTU Programming Club”. But you can retain the dignity of our “BSMRSTU Programming Club” by answering the question. Now try to do this. The miscreant gives an integer number N. You have to find that whether the number can be represented or not with the sum of two consecutive integer and the integers must be greater than zero. If it is possible to represent then you have to mention the two integers.

#### Input Format

Given an Integer 1 <= N <= 10^{18}

#### Output Format

Print "NO" if it is not possible otherwise print "YES" without quota. If the answer is "YES" print the two integers in second line.#### Samples

###### Input

10

###### Output

NO

###### Input

5

###### Output

YES
2 3

Limits

Language | Time | Memory |

GNU C 11 | 1s | 512MB |

GNU C++ 14 | 1s | 512MB |

GNU C++ 11 | 1s | 512MB |

Statistics