import std.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.string;

bool solve (int n, int [] a)
{
	auto m = 1 << n;

	for (int s = 0; s < m; s++)
	{
		int r = m - 1 - s;
		int t = r;
		do
		{
			int cur = 0;
			foreach (i; 0..n)
			{
				if (s & (1 << i))
				{
					cur += a[i];
				}
				if (t & (1 << i))
				{
					cur -= a[i];
				}
			}
			if (cur == 0 && !(s == 0 && t == 0))
			{
				return true;
			}

			t = (t - 1) & r;
		}
		while (t != r);
	}

	return false;
}

void main ()
{
	auto tests = readln.strip.to !(int);
	foreach (test; 0..tests)
	{
		auto n = readln.strip.to !(int);
		auto a = readln.splitter.map !(to !(int)).array;
		writeln (solve (n, a) ? "YES" : "NO");
	}
}
