#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
const int N=10005,B=30;
int n,f[N],g[N],a[10005],s[N];
mt19937_64 rnd(1238123126361237);
inline int lowbit(int x)
{
    if (!x) return 0;
    return (x&-x);
}
void BellaKira()
{
    bool bl=1;
    n=100;
    cin>>n;
    for (int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a+1,a+n+1);
    for (int i=1;i<=n;i++) s[i]=s[i-1]+a[i];
    for (int i=0;i<=n;i++) f[i]=inf;
    f[1]=0;
    for (int i=1;i<=n;i++)
    {
        for (int j=0;j<=n;j++) g[j]=inf;
        for (int j=1;j<=n;j++)
        {
            g[j-1]=min(g[j-1],f[j]+lowbit(j-1));
            if (j*2<=n) f[j*2]=min(f[j*2],f[j]+s[n-i+1]);
        }
        for (int j=0;j<=n;j++) f[j]=g[j];
    }
    cout<<f[0]-(n-1)<<'\n';
}
signed main()
{
    // freopen("std.out","w",stdout);
    IOS;
    cin.tie(0);
    int T=1;
    cin>>T;
    while (T--)
    {
        BellaKira();
    }
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/