calculate sum of primes present as digits of given number N.

i/p:
1st line:-nbr of test case (n).
nextlines:- line:-numbers for(n)
sample
 i/p:
3
123456
123456789
111111111

o/p:
10  (2+3+5)
17(2+3+5+7)
0(none of are the prime)


import java.util.*;
public class NewClass16 {
    void primesum(String s)
    {
        int sum=0,i=0;
        while(i<s.length())
        {
            int a=s.charAt(i)-'0';
            if(a%10==2 || a%10==3 || a%10==5 || a%10==7)
            sum+=a%10;
           i++;
        }
        System.out.println(sum);
    }
    public static void main(String args[])
    {
        Scanner s=new Scanner(System.in);
        int n=s.nextInt();
        NewClass16 ob=new NewClass16();
        for(int i=0;i<n;i++)
        {
            String k=s.next();
            ob.primesum(k);
           
        }
    }
}