you strive to join the secret "fraternity of digital Pythagoreans." This ancient society believes that the numbers rule the universe, and special, "perfect" numbers, store the key to the harmony of the world. To prove your value, you must pass the “test of perfection”.
rn
The program receives a sequence of natural numbers to the input, each on a new line. The input ends with the number 0. For each entered number (except 0), it is necessary to determine whether it is perfect.
rn
certificate: the completed number & mdash; This is a natural number equal to the sum of all their own divisors (that is, all positive divisors, different from the number itself). For example, for the number 6, their own dividers are 1, 2 and 3. Their amount is 1 + 2 + 3 = 6, which means 6 & mdash; Perfect number.
Input format
Entires are supplied to the input of the program, each on a new line. The last number in the sequence is always 0. This number & mdash; A sign of the end of the input, and it is not necessary to process it.
Output format
For each number from the input sequence (except 0), the program must derive the word "yes" on a separate line, if the number is completed, and "no", if not.
Hint
There will be no clue here, decide for yourself!