#include <algorithm>
#include <iostream>
#include <iomanip>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>
using namespace std;
//#pragma comment(linker,"/STACK:102400000,102400000")

int n;
long long x[1001];

int MAIN()
{
    int T;
    cin >> T;
    while(T--)
    {
        cin >> n;
        for(int i = 1; i <= n; i++)
            cin >> x[i];
        long long sumOdd = 0, sumEven = 0;
        for(int i = 1; i <= n; i++)
            if(i % 2 == 1)
                sumOdd += x[i];
            else
                sumEven += x[i];
        bool ok = true;
        if(sumOdd != sumEven)
            ok = false;
        bool pal = true;
        for(int i = 1; i <= n; i++)
            if(x[i] != x[n+1-i])
                pal = false;
        if(pal)
            ok = false;
        if(ok)
            cout << "Yes" << endl;
        else
            cout << "No" << endl;

    }
    return 0;
}

int main()
{
    #ifdef LOCAL_TEST
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #endif
    ios :: sync_with_stdio(false);
    cout << fixed << setprecision(16);
    return MAIN();
}