Problem: Our juniors has just entered in coding community. Their first task is to find the frequency of Best numbers present in given list of elements.
Best numbers are numbers which are divisible by 2.

SAMPLE INPUT
2
5
1 2 3 4 5
3
1 3 5

SAMPLE OUTPUT
2
0

Explanation

Number of test cases=2
1st test case, number of elements =5 
Best numbers are  2 , 4 ; frequency=2
2nd test case, number of elements =3
No Best numbers

Solution (in PYTHON):

Solution:
import collections

def modulo2(x):
    return x%2

def returnCount(_inp):
    intermed_list = map(modulo2, _inp)
    list_freq = collections.Counter(intermed_list)
    return list_freq[0]

total_lines = int(raw_input())
i = 0
while i < total_lines:
    n = raw_input()
    list_numstr = str(raw_input()).split()
    list_num = map(int,list_numstr)
    print returnCount(list_num)
    i+=1