Today we have a number sequence A includes n elements. Nero thinks a number sequence A is good only if the sum of its elements with odd index equals to the sum of its elements with even index and this sequence is not a palindrome. Palindrome means no matter we read the sequence from head to tail or from tail to head,we get the same sequence. Two sequence A and B are consider different if the length of A is different from the length of B or there exists an index i that $A_{i}\neq B_{i}$. Now,give you the sequence A,check out it’s good or not.
输入解释
The first line contains a single integer T,indicating the number of test cases. Each test case begins with a line contains an integer n,the length of sequence A. The next line follows n integers $A_{1},A_{2}, \ldots, A_{n}$.
[Technical Specification] 1 <= T <= 100 1 <= n <= 1000 0 <= $A_{i}$ <= 1000000
输出解释
For each case output one line,if the sequence is good ,output "Yes",otherwise output "No".