PROGRAMMING:Enter all completions within n
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.
Now, the user input n, please output all completions within n.
###Input format:
A positive integer n (6 < = n < = 10000).
###Output format:
Output all completions within n, one completion takes up one line.
###Input sample 1:
```in
one hundred
```
###Output sample 1:
```out
six
twenty-eight
```
answer：If there is no answer, please comment
This is a double loop problem, outer loop variable I from 1 to n. For each outer loop variable I, we first need to determine whether it is a complete number. If it is a complete number, we output I.
Now, the user input n, please output all completions within n.
###Input format:
A positive integer n (6 < = n < = 10000).
###Output format:
Output all completions within n, one completion takes up one line.
###Input sample 1:
```in
one hundred
```
###Output sample 1:
```out
six
twenty-eight
```
answer：If there is no answer, please comment
This is a double loop problem, outer loop variable I from 1 to n. For each outer loop variable I, we first need to determine whether it is a complete number. If it is a complete number, we output I.