#include <bits/stdc++.h>
#define N 400
#define S 100
#define ll long long
using namespace std;
ll dp[N][N][S];
int T, n, w[N];
ll sum[N];
int main() {
  // freopen("a.in", "r", stdin);
  cin.tie(0)->sync_with_stdio(0);
  cin >> T;
  while (T--) {
    cin >> n;
    for (int i = 1; i <= n; i++)
      for (int j = i; j <= n; j++) {
        memset(dp[i][j], 0x3f, sizeof(dp[i][j]));
      }
    for (int i = 1; i <= n; i++)
      cin >> w[i], dp[i][i][0] = 0;
    sort(w + 1, w + n + 1);
    for (int i = 1; i <= n; i++)
      sum[i] = sum[i - 1] + w[i];
    for (int l = n; l >= 1; l--)
      for (int r = l + 1; r <= n; r++) {
        for (int i = __lg(r - l + 1); i <= r - l + 1 && i < S; i++) {
          vector<ll> tmp;
          for (int j = l; j < r; j++) {
            ll mi = LLONG_MAX;
            for (int k = max(__lg(r - j), i - 3); k < r - j && k < i; k++) {
              dp[l][r][i] =
                  min(dp[l][r][i], dp[l][j][i - 1] + dp[j + 1][r][k] +
                                       (1ll << k) - 1 + sum[r] - sum[l - 1]);
              mi = min(mi, dp[l][j][i - 1] + dp[j + 1][r][k] + (1ll << k) - 1 +
                               sum[r] - sum[l - 1]);
            }
            tmp.push_back(mi);
            /*for (int i = 0; i + 1 < tmp.size(); i++)
              cout << (tmp[i] < tmp[i + 1]) << " ";
            cout << endl;*/
          }
          if (i && dp[l][r][i] > dp[l][r][i - 1])
            break;
        }
      }
    cout << *min_element(dp[1][n], dp[1][n] + S) << '\n';
    // cout.flush();
  }
  return 0;
}