#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll inf=1e18;
int n;ll w[500050];
int g[500050];
ll f[103][103][103],sum[103];
void cmin(ll &x,const ll y){x=min(x,y);}
void solve(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i)scanf("%lld",&w[i]);
	sort(w+1,w+n+1);
	for(int i=1;i<=n;++i)
	 for(int j=i;j<=n;++j)
	   for(int k=0;k<=n;++k)f[i][j][k]=inf;
	for(int i=1;i<=n;++i)f[i][i][0]=0,sum[i]=sum[i-1]+w[i];
	for(int i=n-1;i>=1;--i)
	    for(int j=i+1;j<=n;++j)
	        for(int k=i;k<j;++k)
	          for(int lef=g[k-i+1];lef<=2*g[k-i+1]&&lef<=k-i+1;++lef)
	            for(int rig=g[j-k];rig<=2*g[j-k]&&rig<=j-k;++rig)
	                cmin(f[i][j][max(lef,rig)+1],f[i][k][lef]+f[k+1][j][rig]+sum[j]-sum[i-1]+(1ll<<min(lef,rig))-1ll);
	ll ans=inf;
	for(int i=0;i<=n;++i)cmin(ans,f[1][n][i]);
	printf("%lld\n",ans);
}
int main(){
	g[1]=0;
	for(int i=2;i<=500000;++i)g[i]=max(g[i/2],g[i-i/2])+1;
	int t;cin>>t;
	while(t--)solve();
	return 0;
}