#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 2050;
int f[N][N];
int t;
int n;
int a[N];
int main()
{
    cin >> t;
    while (t--)
    {
        memset(f, 0, sizeof f);
        cin >> n;
        
        for (int i = 1; i <= n; i ++ )
            cin >> a[i];
        f[0][0] = 1;    
        for (int i = 1; i <= n; i ++ )
        {    for (int j = 0; j <= 2048; j ++ )
            {
                f[i][j] = f[i - 1][j];
                if (j >= a[i]) f[i][j] += f[i - 1][j - a[i]];
            }
        }
        if (f[n][2048]) cout << "YES" << endl;
        else cout << "NO" << endl;
        
    }
}