We know that a prime number is a number that is divisible only by itself and (e.g. ).
Alice has a string of size . She calls a string good if the sum of ASCII values of all characters is a prime number. For example, let she has a string "". Now the sum of the ASCII values of '', '',
and '' is — which is a prime number. Then we can consider the string "" as a good string.
Now your task is to help Alice to find out the string is good or not.
Each test contains multiple test cases. The first line contains the number of test cases . The description of the test cases follows.
The first line of each test case contains only one integer — the length of the string.
The next line contains the string . It is given that consists of both English uppercase and lowercase letters.
For each input first print "Case #X: " (where is the case number). Then, print "Yes" if the string is good, or, print "No". Always print without quotes.
2 3 abb 3 aba
Case #1: Yes Case #2: No
denotes the length of .