#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
void _print() { cerr << "]\n"; }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
template <typename T>
void show(const T &x) {
  int f = 0;
  for (auto &i : x) cout << (f++ ? " " : ""), __print(i);
  cout << "\n";
}
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i += 1) {
    cin >> a[i];
  }
  sort(begin(a), end(a));
  int zeros = 0, j = 0, cont = 0;
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] == 0)
      zeros++;
    else {
      if (a[i] >= (1 << j) and a[i] < (1 << (j + 1))) {
        cont++;
      } else if (a[i] >= (1 << (j + 1))) {
        ans += 1LL * cont * (cont - 1) / 2;
        cont = 1;
        while (a[i] >= (1 << (j + 1))) j++;
      }
    }
  }
  ans += 1LL * cont * (cont - 1) / 2;
  ans += 1LL * zeros * (cont - 1) / 2;
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
