// Problem: B3660 [语言月赛202209] 集卡
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/B3660
// Memory Limit: 128 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

//#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define int long long
#define double long double
#define RE register
#define endl putchar('\n')
#define mp make_pair
#define pr pair < int , int >
#define It iterator
#define NF string::npos // NT --> NOT_FOUND
#define swap(x, y) (x ^= y ^= x ^= y)
#define max(x, y) (x > y ? x : y)
#define min(x, y) (x < y ? x : y)
#define ls(x) (x << 1)  // x * 2
#define rs(x) (x << 1 | 1) // x * 2 + 1
using namespace std;
const int INF = 2147483647;
const int SZ = 1e4 + 5;
int t, n, x, f;
// 变量
inline int read() {
	RE int X=0,w=0; RE char ch=0;
	while (!isdigit(ch)) { w |= ch == '-'; ch = getchar(); }
	while (isdigit(ch)) { X = (X << 3) + (X << 1) + (ch ^ 48); ch = getchar(); }
	return w ? -X : X; }
inline void write(int x) {
	if (x < 0) { x = ~x + 1; putchar('-'); }
	if(x > 9) write(x / 10);
	putchar(x % 10 + '0'); }
// 函数

signed main(void)
{
	//freopen("input.in","r",stdin);
	//freopen("output.out","w",stdout);
	t = read();
	while (t--) {
		n = read();
		f = 0;
		while (n--) {
			x = read();
			if (x == 0) {
				puts("yes");
				f = 1;
				break;
			}
		}
		if (!f) puts("no");
	}
	//fclose(stdin);
	//fclose(stdout);
	return 0;
}

???