//Coded by Vishal Mourya
//If you use this code anywhere you need to mention my name as above
#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define pb push_back
#define f(a,b) for( ll i = a ; i < b ; i++ )
#define fe(a,b) for( ll i = a ; i <= b ; i++ )
#define fj(a,b) for( ll j = a ; j < b ; j++ )
#define fk(a,b) for( ll k = a ; k < b ; k++ )
#define fasthoja ios_base::sync_with_stdio(false); cin.tie(NULL);
#define maxN 100001
#define mod 1000000007
using namespace std;
int main(void){
fasthoja;
ll t; cin>>t;
while(t--){
ll n; cin >> n;
vec v(n);
f(0,n) cin >> v[i];
//main logic of problem
ll allXor = v[0] ^ v[1];
f(2,n){
allXor ^= ( v[i] );
}
if( allXor % 2 == 0 ) cout << "YES\n";
else cout << "NO\n";
}//end of test case loop
return 0;
}
Ly9Db2RlZCBieSBWaXNoYWwgTW91cnlhCi8vSWYgeW91IHVzZSB0aGlzIGNvZGUgYW55d2hlcmUgeW91IG5lZWQgdG8gbWVudGlvbiBteSBuYW1lIGFzIGFib3ZlIAoKI2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KI2RlZmluZSBsbCBsb25nIGxvbmcgaW50IAojZGVmaW5lIHZlYyB2ZWN0b3I8bGw+CiNkZWZpbmUgcGIgcHVzaF9iYWNrCiNkZWZpbmUgZihhLGIpIGZvciggbGwgaSA9IGEgOyBpIDwgYiA7IGkrKyApCiNkZWZpbmUgZmUoYSxiKSBmb3IoIGxsIGkgPSBhIDsgaSA8PSBiIDsgaSsrICkKI2RlZmluZSBmaihhLGIpIGZvciggbGwgaiA9IGEgOyBqIDwgYiA7IGorKyApCiNkZWZpbmUgZmsoYSxiKSBmb3IoIGxsIGsgPSBhIDsgayA8IGIgOyBrKysgKQojZGVmaW5lIGZhc3Rob2phIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOyBjaW4udGllKE5VTEwpOwojZGVmaW5lIG1heE4gMTAwMDAxCiNkZWZpbmUgbW9kIDEwMDAwMDAwMDcKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKHZvaWQpewogICAgZmFzdGhvamE7CiAgICBsbCB0OyBjaW4+PnQ7CiAgICB3aGlsZSh0LS0pewogICAgCQogICAgIGxsIG47IGNpbiA+PiBuOwogICAgIHZlYyB2KG4pOwogICAgIGYoMCxuKSBjaW4gPj4gdltpXTsKICAgICAKICAgICAvL21haW4gbG9naWMgb2YgcHJvYmxlbQogICAgIGxsIGFsbFhvciA9IHZbMF0gXiB2WzFdOwogICAgIAogICAgIGYoMixuKXsKICAgICAgYWxsWG9yIF49ICggdltpXSApOwogICAgIH0KICAgICAKICAgICBpZiggYWxsWG9yICUgMiA9PSAwICkgY291dCA8PCAiWUVTXG4iOwogICAgIGVsc2UgY291dCA8PCAiTk9cbiI7CiAgICB9Ly9lbmQgb2YgdGVzdCBjYXNlIGxvb3AgCiAgICByZXR1cm4gMDsKfQ==