简单的说:只要奇数位的奇偶一致并且偶数位奇偶一致就可以,否则就不可以
#include<iostream>
#include<algorithm>
#include<vector>
#include<bitset>
#include<cmath>
#include<set>
#include<climits>
#include<queue>
#include<cstring>//memset头文件
using i64 = int64_t;
using namespace std;
#define endl '\n'
#define int i64
const int maxn = 100;
int num[maxn];//记录字符串个数
void slove()
{
//memset(num,0,sizeof num);
int n,ans = 0;
bool is = true;
cin >> n;
for(int i = 1;i <= n;i++)
{
cin >> num[i];
if(i & 1 && num[i] % 2 != num[1] % 2)
is = false;
if((i & 1) == 0 && num[i] % 2 != num[2] % 2)
is = false;
}
is ? cout << "YES" << endl : cout << "NO" << endl;
}
signed main()
{
cin.tie(0) -> sync_with_stdio(false);
int T = 1;
cin >> T;
while(T--)
slove();
return 0;
}