#include<bits/stdc++.h>
#define L(i,s,t) for(int i=(s);i<=(t);++i)
#define R(i,s,t) for(int i=(s);i>=(t);--i)
#define T(i,s,t) for(int i=(s);i< (t);++i)
#define iI inline int
#define iV inline void
#define ll long long
#define eb emplace_back
#define ll long long
#define lb(x) (x&(-x))
using namespace std;
const int N=1e2+3;
const ll inf=1e18;
int tim,n,w[N];
ll f[N],g[N],s[N];
iV chn(ll &x,ll y) {x=x<y?x:y;}
iV sol() {
    cin>>n;
    L(i,1,n) cin>>w[i];
    sort(w+1,w+n+1);
    L(i,1,n) s[i]=s[i-1]+w[i];
    L(i,1,n) f[i]=inf;
    f[1]=0;
    L(i,1,n) {
    	L(j,1,n) g[j]=inf;
	    R(j,i,1) {
	    	if(!(j&1)) chn(f[j>>1],f[j]+s[i]);
	    	chn(g[j+1],f[j]+lb(j));
		}
		if(i<n) memcpy(f+1,g+1,n<<3);
	}
    cout<<f[1]-n+1<<"\n";
}
int main() {
    cin>>tim;while(tim--) sol();
    return 0;
}