#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

const int N = ;

int n;

int a[N];

bool f[N];

int main() {

    int T;

    cin >> T;

    while (T -- ) {

        cin >> n;

        for (int i = ; i < n; i ++ )

            cin >> a[i];

        sort(a, a + n);//货币从小到大排序

        int m = a[n - ];//取最后一个货币 ，也就是最大体积

        memset(f, , sizeof f);

        f[] = true;

        int k = ;

        for (int i = ; i < n; i ++ ) {

            if (!f[a[i]])//从小开始看，如果没有拼凑方案

                k ++ ;

            for (int j = a[i]; j <= m; j ++ )

                f[j] += f[j - a[i]];

        }

        cout << k << endl;

    }

    return ;

}