PROGRAMMING:The problem of summation of prime numbers
###Task description
Now I give you n numbers (0 < n < 1000). Now I ask you to write a program to find all prime numbers in the N numbers and sum them.
###Input format:
The first line shows how many groups of test data the integer m (0 < m < 10) represents. The first line of each group of test data gives you n, which represents the number of test data in this group. The next N numbers are the data to be tested, and each number is less than 1000.
###Output format:
Each group of test data results occupy one line, and the sum of all prime numbers of the given test data is output.
###Input example:
```in
three
five
1 2 3 4 5
eight
11 12 13 14 15 16 17 18
ten
21 22 23 24 25 26 27 28 29 30
```
###Output example:
```out
ten
forty-one
fifty-two
```
###Title Source
Note: this topic is selected from nyoj website http://nyoj.top/problem/22
answer：If there is no answer, please comment
Now I give you n numbers (0 < n < 1000). Now I ask you to write a program to find all prime numbers in the N numbers and sum them.
###Input format:
The first line shows how many groups of test data the integer m (0 < m < 10) represents. The first line of each group of test data gives you n, which represents the number of test data in this group. The next N numbers are the data to be tested, and each number is less than 1000.
###Output format:
Each group of test data results occupy one line, and the sum of all prime numbers of the given test data is output.
###Input example:
```in
three
five
1 2 3 4 5
eight
11 12 13 14 15 16 17 18
ten
21 22 23 24 25 26 27 28 29 30
```
###Output example:
```out
ten
forty-one
fifty-two
```
###Title Source
Note: this topic is selected from nyoj website http://nyoj.top/problem/22
answer：If there is no answer, please comment