#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define F first
#define S second

const int MAXN = 1e4 + 10;

int n, a[MAXN];
vector<pii> vec;

int get(){
	bitset<MAXN> can;
	can.set(1);
	for (int i = 0; i < (int)vec.size(); i++){
		int t = vec[i].S;
		for (int w = 0; (1<<w) <= t; w++){
			int x = (1<<w)*vec[i].F;
			can |= can << x;
			t -= 1<<w;
		}
		can |= can << (t*vec[i].F);
	}
	return can.count();
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int te;	cin >> te;
	while (te--){
		cin >> n;
		for (int i = 0; i < n; i++) cin >> a[i];

		sort(a, a + n);
		vec.clear();
		for (int l = 0; l < n;){
			int r = l;
			while (r < n && a[l] == a[r]) r++;
			vec.push_back({a[l], r-l});
			l = r;
		}

		
		int ans = 0;
		for (int i = 0; i < (int)vec.size(); i++)
			for (int j = i; j < (int)vec.size(); j++)
				if (i == j && vec[i].S > 1 || i != j){
					vec[i].S--, vec[j].S--;
					ans = max(ans, get());
					vec[i].S++, vec[j].S++;
				}
		cout << ans*4 << "\n";
	}
	return 0;
}