N cards were lying on the table in annabelle's room.
Every card has a magic number written on it.
Now the ghost buster claimed that he can catch ghost spirit only if following condition is fullfilled :
"If it is possible to divide N cards into N/2 pairs such that sum of numbers on cards for every pair is same."
Your job is to tell whether it is possible or not.
Input :
First line will contain an integer T (number of test cases).
T blocks of line follows.
First line of each block contains an integer N (number of cards).
Next line contains N integers (numbers written on cards).
Output :
For each testcase print "YES" or "NO".
Constraint :
N is always even
T<=100
N<=200
0<=number on cards <=100000