PROGRAMMING:Judge whether a number is complete or not
The so-called perfect number means that the sum of its factors is just its own positive integer. For example, the factor of 6 is 1,2,3, and 1 + 2 + 3 = 6, so 6 is a perfect number and the smallest one.
###Input format:
Enter a positive integer n of type int.
###Output format:
If n is perfect. Please output yes, otherwise output No.
###Input sample 1:
```in
twenty-eight
```
###Output sample 1:
```out
Yes
```
###Input sample 2:
```in
one hundred and eighty-nine
```
###Output sample 2:
```out
No
```
answer：If there is no answer, please comment
Starting from the definition of completion, let the loop variable I start from 1 and try to N / 2 (because when I > n / 2, n can no longer be divisible by I), as long as n can be divisible by I, it will be accumulated into S. At the end of the cycle, judge whether n is complete according to whether s is equal to n.
###Input format:
Enter a positive integer n of type int.
###Output format:
If n is perfect. Please output yes, otherwise output No.
###Input sample 1:
```in
twenty-eight
```
###Output sample 1:
```out
Yes
```
###Input sample 2:
```in
one hundred and eighty-nine
```
###Output sample 2:
```out
No
```
answer：If there is no answer, please comment
Starting from the definition of completion, let the loop variable I start from 1 and try to N / 2 (because when I > n / 2, n can no longer be divisible by I), as long as n can be divisible by I, it will be accumulated into S. At the end of the cycle, judge whether n is complete according to whether s is equal to n.