不难的NP。。。比赛的时候把题目读错了。。当成神题了。。T.T
#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 1005
#define maxm 40005
#define eps 1e-10
#define mod 1000000007
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp mark_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid
#define rson o<<1 | 1, mid+1, R
typedef long long LL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head
int n, num[maxn], dp[maxn];
void work(void)
{
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", &num[i]);
dp[n+1] = 0;
for(int i = n; i >= 1; i--)
if(dp[i+1] == 0) dp[i] = 1;
else if(num[i] > 1) dp[i] = 1;
else dp[i] = 0;
if(dp[1]) printf("Yes\n");
else printf("No\n");
}
int main(void)
{
int _;
while(scanf("%d", &_)!=EOF) {
while(_--) {
work();
}
}
return 0;
}