#include <bits/stdc++.h>
using namespace std;

#define vi vector<int>
#define PB push_back
#define vll vector<long long>
#define ll long long
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define ld long double
#define vld vector<long double>

const ll mod = 998244353;
const ll MOD = 1e9 + 7;

ll sum(ll n){
    return (n * (n + 1)) / 2ll;
}

void solve(int tst){
    
    int n;
    cin >> n;

    bitset<50001> dp(0);
    dp[0] = true;

    int x;
    for (int i = 0; i < n; i++){
        cin >> x;
        if (x <= n) dp = (dp | (dp << x));
    }

    for (int i = n; i >= 0; i--){
        if (dp[i]){
            cout << i << "\n";
            return;
        }
    }

}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    // pre();
    int tc = 1;
    cin >> tc;
    for (int i = 1; i <= tc; i++){
        solve(i);
    }
    return 0;
}