Problem: A prime number is one which is divisible by exactly two numbers 1 and itself.
Given a number, find out if the number obtained by summing all digits of that number is a prime.

Input Format:
The input begins with number of test-cases t in a single line. In each of next tlines there is a number n.

Output Format
In each line print YES if sum of digits of the number is a prime.Otherwise print NO.

t < 100000, 1 < n < 1000000

Example
There are 3 test cases here 32, 51, 101

Input:

3

32

51

101

Output

YES

NO

YES

Explanation

Number of test cases t = 3

32 -> 3 + 2 = 5 . Since 5 is a prime , we print YES

51 -> 5 + 1 = 6 . Since 6 is not a prime , we print NO

101 ->1+0+1 = 2 . Since 2 is a prime , we print YES

SAMPLE INPUT
2
33
122

SAMPLE OUTPUT
NO
YES

Solution (in PYTHON):

Solution:
def pseive(n):
    sieve = [True] * (int)(n/2)
    for i in range(3,int(n**0.5)+1,2):
        if sieve[(int)(i/2)]:
            sieve[(int)(i*i/2)::i] = [False] * (int)((n-i*i-1)/(2*i)+1)
    return [2] + [2*i+1 for i in range(1,(int)(n/2)) if sieve[i]]

def getSum(n):
	ans=0
	while n>0:
		ans+=n%10
		n=n/10
	return ans
    
t= input()
primes = pseive(10000)
for _ in range(t):
	n=input()
	if getSum(n) in primes:
		print "YES"
	else:
		print "NO"