Time Limit: 2 seconds Memory Limit: 256 megabytes ---------- Write a program that receives a number such as $n$ from the user and prints `YES` if it possesses the property of being "perfect," and `NO` otherwise. A positive integer such as $n$ is "perfect" if and only if the sum of the divisors of $n$ (excluding $n$ itself) is equal to $n$. # Input The number $n$ is given to you in one line. $$ 2 \leq n \leq 200,000$$ # Output If the number is perfect, print `YES`, otherwise print `NO`. # Examples ## Sample Input 1 ``` 27 ``` ## Sample Output 1 ``` NO ``` The divisors of $27$ that are smaller than it are $1$, $3$, and $9$, and their sum is $$1 + 3 + 9 = 13 \neq 27$$ Thus, $27$ is not perfect. ## Sample Input 2 ``` 6 ``` ## Sample Output 2 ``` YES ``` The divisors of $6$ that are smaller than it are $1$, $2$, and $3$, and their sum is $$1 + 2 + 3 = 6$$ Thus, $6$ is perfect.