PROGRAMMING:Write a prime function
Write a prime function fun. Input an integer n in the main function, judge whether the output is a prime in the function fun, and find out whether the number is a prime in the main function.
###Input format:
There are several groups of test data, which are processed to the end of the file. Each group of test data input integer n (0 < n < 1000000000).
###Output format:
N of each group is prime number, output yes, otherwise output No.
###Input example:
Here is a set of inputs. For example:
```in
fifty-nine
sixty-nine
one hundred and twenty-three million four hundred and fifty-six thousand seven hundred and eighty-nine
```
###Output example:
The corresponding output is given here. For example:
```out
YES
NO
NO
```
answer:If there is no answer, please comment
###Input format:
There are several groups of test data, which are processed to the end of the file. Each group of test data input integer n (0 < n < 1000000000).
###Output format:
N of each group is prime number, output yes, otherwise output No.
###Input example:
Here is a set of inputs. For example:
```in
fifty-nine
sixty-nine
one hundred and twenty-three million four hundred and fifty-six thousand seven hundred and eighty-nine
```
###Output example:
The corresponding output is given here. For example:
```out
YES
NO
NO
```
answer:If there is no answer, please comment