N bulbs are in a row from left to right,some are on, and some are off.The first bulb is the most left one. And the last one is the most right one.they are numbered from 1 to n,from left to right.

in order to save electricity, you should turn off all the lights, but you're lazy. coincidentally,a passing bear children paper(bear children paper means the naughty boy), who want to pass here from the first light bulb to the last one and leave.

he starts from the first light and just can get to the adjacent one at one step. But after all,the bear children paper is just a bear children paper. after leaving a light bulb to the next one, he must touch the switch, which will change the status of the light.

your task is answer whether it's possible or not to finishing turning off all the lights, and make bear children paper also reach the last light bulb and then leave at the same time.

The first line of the input file contains an integer T, which indicates the number of test cases.

For each test case, there are 2 lines.

The first line of each test case contains 1 integers n.

In the following line contains a 01 sequence, 0 means off and 1 means on.

• 1 \leq T \leq 101≤T≤10
• 1 \leq N \leq 10000001≤N≤1000000

There should be exactly T lines in the output file.

The i-th line should only contain "YES" or "NO" to answer if it's possible to finish.

1

5

1 0 0 0 0

YES

#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstring>

#include<vector>

#include<map>

#include<algorithm>

#include<queue>

using namespace std;

const int INF=0x3f3f3f3f;

#define mem(x,y) memset(x,y,sizeof(x))

#define PI(x) printf("%d",x)

#define SI(x) scanf("%d",&x)

#define T_T while(T--)

const int MAXN=1000010;

int a[MAXN];

int main(){

	int T,N;

	SI(T);

	T_T{

		SI(N);

		int temp=0,ans=0;

		for(int i=0;i<N;i++){

			SI(a[i]);

		}

		for(int i=0;i<N;i++){

			if(a[i]){

				if(temp&1)ans++;

				temp=0;

			}

			else temp++;

		}

		if(temp&1)ans++;

		//printf("%d\n",ans);

		if(ans%2==0)puts("YES");

		else puts("NO");

	}

	return 0;

}