PROGRAMMING:Finding prime numbers

Find prime numbers within n (2 < = n < = 200) (including n).
###Input format:
There are several groups of test data, which are processed to the end of the file. Enter an integer n for each group.
###Output format:
Each group outputs prime numbers within n (inclusive). A space between every two prime numbers.
###Input example:
Here is a set of inputs. For example:
```in
twenty
eighty
one hundred and forty
```
###Output example:
The corresponding output is given here. For example:
```out
2 3 5 7 11 13 17 19
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139
```







answer：If there is no answer, please comment