#include <bits/stdc++.h>
using namespace std;
int T, n, a[10009];
int main() {
scanf ("%d", &T);
while (T--) {
int s1 = 0, s2 = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
bool flag = true;
for (int i = 1; i <= n / 2; i++) {
if (a[i] != a[n - i + 1]) {
flag = false;
break;
}
}
if (flag) {
cout << "No" << endl;
continue;
}
for (int i = 1; i <= n; i++) {
if (i % 2 == 0)
s1 += a[i];
else
s2 += a[i];
}
//cout << s1 << " " << s2 << endl;
if (s1 == s2)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
