Codeforces 1221A

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define p_b pop_back
#define si stack<int>
#define sll stack<ll>
#define sc stack<char>
#define vi vector<int>
#define vll vector<ll>
#define mii map<int, int>
#define msi map<string, int>
#define mci map<char, int>
#define qc queue<char>
#define qi queue<int>
#define qll queue<ll>
using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin >> t;
    while(t--){
        int n;
        bool f = false;
        cin >> n;

        map<ll, int> m;
        for(int i = 0; i < n; i++){
            ll x;
            cin >> x;
            m[x]++;
        }

        auto i = m.begin();
        while(i != m.end()){
            if(i->first == 2048){
                f = true;
                break;
            }

            ll p = i->first*i->second;
            if(p == 2048){
                f = true;
                break;
            } else if(p < 2048){
                if(2048%p == 0){
                    m.erase(i);
                    m[p]++;
                }
            }

            i++;
        }

        if(f){
            cout << "YES\n";
        } else{
            cout << "NO\n";
        }
    }
    return 0;
}