array bitwise &

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef tree<int,null_type,less<>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;

#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define MOD 1000000007
#define PI 3.14159265
#define ceil(a, b) ((a / b) + (a % b ? 1 : 0))
#define imin INT_MIN
#define imax INT_MAX
#define nl '\n'
#define modulo(a, b, m) ((a % m) * (b % m)) % m

void Start_Crushing() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}
//vector<int> dx = {0, 0, 1, -1, 1, 1, -1, -1}, dy = {1, -1, 0, 0, 1, -1, 1, -1};
//int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};


void solve(){
    unordered_map<int, long> powerFreq, powerMatching;

    int n; cin >> n;
    vector<int> v(n);

    long ans = 0;
    for(auto& i : v){
        cin >> i;
        if(log2(i) == int(log2(i))){
            powerFreq[i]++;
        }else{
            for(long bit = 0; bit < 31; bit++){
                if(i & (1 << bit)){
                    powerFreq[(1 << bit)]++;
                }
            }
        }
    }

    for(auto& [x, y] : powerFreq){
        ans += y * (y - 1) / 2;
    }
    for(auto& [x, y] : powerMatching){
        ans += y * powerFreq[x];
    }
    cout << ans;
}

int main(){
    //        freopen("equal.in", "r", stdin);
    Start_Crushing();
    int t = 1;
//    /*is Single Test case?*/ cin >> t;
    while (t--) {
        solve();
        if(!t) break;
        cout << "\n";
    }

    return 0;
}