// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

const int N = 1e4;
int a, f[N + 5], g[N + 5], s[N + 5], pre[N + 5];

void ck(int &n, int m) {n = min(n, m);}
int val(int n) {return (n & -n) - 1;}

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	// cout << val(2) << endl;
	int T;
	for(cin >> T; T--; ) {
		cin >> a;
		rep(i, 1, a) cin >> s[i];
		sort(s + 1, s + a + 1);
		rep(i, 1, a) pre[i] = pre[i - 1] + s[i];
		rep(i, 1, a) f[i] = 1e18;
		f[1] = 0;
		rep(i, 1, a) {
			rep(j, 1, a) g[j] = 1e18;
			per(j, i, 1) {
				ck(g[j + 1], f[j] + val(j));
				if(!(j & 1)) ck(f[j >> 1], f[j] + pre[i]);
			}
			swap(f, g);
		}
		cout << g[1] << '\n';
	}
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}