PROGRAMMING:Jack Cheng's troubles 3
Jack Cheng encountered a programming problem in his book, but he couldn't do it. He had no choice but to ask you for help. It is required to judge whether a given number is "true prime". The definition of true prime is that it is a prime and the sum of its digits is still a prime. For example, 11 is a prime, and 1 + 1 = 2 is also a prime, so 11 is a true prime.
###Input format:
Enter the number n to be judged in one line
###Output format:
If n is a true prime, output "yes", otherwise output "no".
###Input example:
```in
eleven
```
###Output example:
```out
yes
```
answer：If there is no answer, please comment
###Input format:
Enter the number n to be judged in one line
###Output format:
If n is a true prime, output "yes", otherwise output "no".
###Input example:
```in
eleven
```
###Output example:
```out
yes
```
answer：If there is no answer, please comment