One day, Delta, the dog, got very angry. He has $N$ items with different values, and he decided to destroy a few of them. However, Delta loves his hooman as well. So he only destroyed those items whose Least Significant Bit in binary representation is 0. 
Can you help Delta to find the total damage he did so he could make an equally sorry face?

-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow. 
- First line of Each test case a single integer $N$.
- Next line contains $N$ integers denoting values of items.

-----Output:-----
For each testcase, output in a single line the total damage caused by Delta.

-----Constraints-----
- $1 \leq T \leq 10^3$
- $1 \leq N \leq 10^3$
- $1 \leq value \leq 10^3$

-----Sample Input:-----
1
5

1 2 3 4 5

-----Sample Output:-----
6

-----EXPLANATION:-----
Total Damage: $2  + 4 = 6$.

Difficulty: UNKNOWN_DIFFICULTY

Solutions:
for test in range(int(input())):
	n = int(input())
	ar = list(map(int, input().split()))
	count = 0
	for item in ar:
		if bin(item)[-1] == '0':
			count += item
	print(count)


def bit(x):
	s = 0
	for i in range(len(x)):
		p = bool(x[i] & 1 << 0)
		if p == False:
			s = s + x[i]
	return s

def __starting_point():
	n = int(input())
	for i in range(n):
		a = int(input())
		x = list(map(int, input().split()))
		print(bit(x))
__starting_point()


for i in range(int(input())):
	m = []
	n = []
	o = []
	(s, x) = (0, 0)
	q = 0
	n = int(input())
	l = list(map(int, input().split()))
	for i in l:
		m.append(str(bin(i)))
	for j in m:
		q = q + 1
		if j[-1] == '0':
			s = s + l[q - 1]
	o.append(s)
	for j in range(len(o)):
		print(o[j])


for _ in range(int(input())):
	n = input()
	a = [int(j) for j in input().split()]
	out = 0
	for j in a:
		if j % 2 == 0:
			out += j
	print(out)


t = int(input())
for i in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	ans = 0
	for j in range(n):
		if arr[j] % 2 == 0:
			ans += arr[j]
	print(ans)


t = int(input())
for i in range(t):
	k = int(input())
	n = list(map(int, input().split()))
	s = 0
	for j in n:
		if j % 2 == 0:
			s += j
	print(s)


for _ in range(int(input())):
	n = int(input())
	c = 0
	l = list(map(int, input().split()))
	for i in range(len(l)):
		if l[i] % 2 == 0:
			c += l[i]
	print(c)


T = int(input())
while T:
	n = int(input())
	l = [int(k) for k in input().split()]
	c = 0
	for i in l:
		if i % 2 == 0:
			c += i
	print(c)
	T -= 1


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	s = 0
	for i in a:
		if i % 2 == 0:
			s += i
	print(s)


from sys import stdin
from math import ceil, gcd

def func():
	return
for _ in range(int(stdin.readline())):
	n = int(stdin.readline())
	arr = list(map(int, stdin.readline().split()))
	s = 0
	for ele in arr:
		if ele % 2 == 0:
			s += ele
	print(s)


T = int(input())
for i in range(T):
	N = int(input())
	sum1 = 0
	a = list(map(int, input().split()))
	for i in a:
		j = i & 1
		if j == 0:
			sum1 += i
	print(sum1)


try:
	t = int(input())
	while t:
		n = int(input())
		arr = [int(i) for i in input().split()]
		des = 0
		for elm in arr:
			try:
				if elm % 2 == 0:
					des += elm
			except:
				pass
		print(des)
		t -= 1
except:
	pass


for _ in range(int(input())):
	n = int(input())
	l1 = list(map(int, input().split()))
	s1 = 0
	for i in l1:
		if i % 2 == 0:
			s1 = s1 + i
	print(s1)


for _ in range(int(input())):
	n = int(input())
	li = list(map(int, input().split()))
	s = 0
	for item in li:
		if item % 2 == 0:
			s += item
	print(s)


for _ in range(int(input())):
	n = int(input())
	b = list(map(int, input().split()))
	c = 0
	for i in range(n):
		if b[i] % 2 == 0:
			c += b[i]
		else:
			continue
	print(c)


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	sum1 = 0
	for x in arr:
		if x % 2 == 0:
			sum1 += x
	print(sum1)


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	ans = 0
	for i in l:
		if i % 2 == 0:
			ans += i
	print(ans)


def LSB(num, K):
	return bool(num & 1 << K - 1)
for i in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	c = 0
	for j in a:
		if not LSB(j, 1):
			c += j
	print(c)


try:
	for _ in range(int(input())):
		n = int(input())
		arr = list(map(int, input().split()))
		ans = 0
		for i in arr:
			if i % 2 == 0:
				ans += i
		print(ans)
except:
	pass


def lsb(i):
	return bool(i & 1 << 0)
t = int(input())
for _ in range(t):
	n = int(input())
	m = list(map(int, input().split()))
	res = []
	for i in m:
		result = lsb(i)
		if result:
			continue
		else:
			res.append(i)
	print(sum(res))


import sys
input = lambda : sys.stdin.readline().rstrip('\r\n')
for _ in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	ans = 0
	for i in a:
		if i & 1 == 0:
			ans += i
	print(ans)


t = int(input())
while t > 0:
	n = int(input())
	l = [int(c) for c in input().split()]
	c = 0
	for i in l:
		b = bin(i).replace('0b', '')
		if b[-1] == '0':
			c += i
	print(c)
	t = t - 1


def dtob(num):
	if num > 1:
		dtob(num // 2)
	return num % 2
t = int(input())
for _ in range(t):
	n = int(input())
	value = list(map(int, input().split()))
	l = []
	for i in range(len(value)):
		b = dtob(value[i])
		if b % 10 == 0:
			l.append(value[i])
	print(sum(l))