#define NO_FREOPEN

#include <algorithm>
#include <array>
#include <iostream>
#include <vector>

using i64 = long long;
using u32 = unsigned int;
using u64 = unsigned long long;

void set_io(std::string name)
{
#ifndef NO_FREOPEN
  freopen((name + ".in").c_str(), "r", stdin);
  freopen((name + ".out").c_str(), "w", stdout);
#endif
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);
}

u64 binom(u64 n, u32 m)
{
  if (m < 0 || m > n) return 0;

  if (m == 1) return n;
  else if (m == 2) return n * (n - 1) / 2;
  else if (m == 3) return n * (n - 1) * (n - 2) / 6;
  else {
    u64 p = 1;
    u64 q = 1;
    for (u32 x = 0; x < m; x++) {
      p *= n - x;
      q *= x + 1;
    }
    return p / q;
  }
}

void solve()
{
  u32 n;
  std::cin >> n;

  u64 ans = binom(n, 3);

  std::vector<u64> a(n);
  for (auto &i : a) std::cin >> i;

  std::sort(a.begin(), a.end());

  std::vector<std::pair<u64, u32>> b;

  for (u32 i = 0; i < n; ) {
    u32 j = i;
    while (j < n && a[i] == a[j]) j++;
    u32 size = j - i;
    b.emplace_back(a[i], size);
    ans -= binom(size, 3);
    i = j;
  }

  u32 m = b.size();
  for (u32 i = 60; i--; ) {
    u32 mid = std::lower_bound(b.begin(), b.end(), 1ull << i, [](const std::pair<u64, u32> &b, u64 y)
                               {
                                 return b.first < y;
                               }) - b.begin();

    u64 mask = (1ull << i) - 1;

    for (auto &[v, _] : b) v &= mask;

    std::vector<std::pair<u64, u32>> c;
    u32 p = 0, q = mid;
    while (p < mid && q < m) {
      if (b[p].first < b[q].first) c.emplace_back(b[p++]);
      else if (b[p].first > b[q].first) c.emplace_back(b[q++]);
      else {
        u32 pr = p;
        u64 f1 = 0, f2 = 0;
        while (pr < mid && b[p].first == b[pr].first) {
          c.emplace_back(b[pr]);
          f1 += b[pr].second;
          f2 += binom(b[pr].second, 2);
          pr++;
        }
        if (i % 2 != 0) {
          f1 = 0;
          f2 = 0;
        }
        u32 qr = q;
        while (qr < m && b[q].first == b[qr].first) {
          c.emplace_back(b[qr]);
          ans -= f1 * binom(b[qr].second, 2);
          ans -= f2 * b[qr].second;
          qr++;
        }
        p = pr;
        q = qr;
      }
    }
    while (p < mid) c.emplace_back(b[p++]);
    while (q < m) c.emplace_back(b[q++]);

    b = std::move(c);
  }

  std::cout << ans << std::endl;
}

int main()
{
  set_io("game");

  int T;
  std::cin >> T;

  while (T--) solve();
}