PROGRAMMING:Output all completions less than n
It is required to output all completions less than n (2 ≤ n ≤ 10000) from small to large. The so-called perfect number is that the number is exactly equal to the sum of the factors except itself. For example: 6 = 1 + 2 + 3, where 1, 2 and 3 are factors of 6.
###Input format:
Enter a value that gives n (2 ≤ n ≤ 10000) in one line.
###Output format:
Output completion number, each number occupies 6 bits. If the completion less than n does not exist, output "None".
###Input example:
```in
one thousand
```
###Output example:
```out
6 28 496
```
answer：If there is no answer, please comment
###Input format:
Enter a value that gives n (2 ≤ n ≤ 10000) in one line.
###Output format:
Output completion number, each number occupies 6 bits. If the completion less than n does not exist, output "None".
###Input example:
```in
one thousand
```
###Output example:
```out
6 28 496
```
answer：If there is no answer, please comment