#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

using ll  = long long;
int const inf = 1<<29;

int main() {

  int T; cin >> T;
  for(;T--;) {
    int N; cin >> N;
    vector<int> v(N);
    rep(i, N) {
      cin >> v[i];
    }
    sort(all(v));
//    rep(i, N) cout << v[i] << " "; cout << endl;

    int res = 0;
    int lpos = 0, rpos = N-1;
    while(rpos - lpos >= 2) {
      if(v[lpos+1] < v[rpos]) res++;
      else if(v[lpos] < v[lpos+1]) res++;
      else break;
      lpos+=2, rpos--;
    }
    cout << res << endl;
  }
  return 0;
}