Digit Sum Prime

Given an integer (n), compute the sum of its digits and determine if the result is a prime number. A number (p) is considered prime if it satisfies (p > 1) and its only divisors are 1 and (p). For example, if (n = 41), the digit sum is (4+1=5), and since 5 is prime, the program should output "Yes". Conversely, if (n = 42), the digit sum is (4+2=6) and 6 is not prime, so the output should be "No".

inputFormat

The input consists of a single integer (n) read from standard input.

outputFormat

Output a single line containing "Yes" if the sum of the digits of (n) is a prime number, and "No" otherwise. The result should be printed to standard output.## sample

41

Yes