PROGRAMMING:Output all prime numbers less than n
This problem requires that all prime numbers less than n (2 ≤ n ≤ 1000) be output from small to large, with 10 per line. A prime is a positive integer that can only be divided by 1 and itself. Note: 1 is not a prime.
###Input format:
Enter a value that gives n (2 ≤ n ≤ 1000) in one line.
###Output format:
Output prime number, each number occupies 6 bits, each line outputs 10. If there is no prime less than N, output "None".
###Input example:
```in
ten
```
###Output example:
```out
2 3 5 7
```
answer：If there is no answer, please comment
###Input format:
Enter a value that gives n (2 ≤ n ≤ 1000) in one line.
###Output format:
Output prime number, each number occupies 6 bits, each line outputs 10. If there is no prime less than N, output "None".
###Input example:
```in
ten
```
###Output example:
```out
2 3 5 7
```
answer：If there is no answer, please comment