1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4.  
  5. /*
  6. ------------------------Input Checker----------------------------------
  7. */
  8.  
  9. long long readInt(long long l,long long r,char endd){
  10.     long long x=0;
  11.     int cnt=0;
  12.     int fi=-1;
  13.     bool is_neg=false;
  14.     while(true){
  15.         char g=getchar();
  16.         if(g=='-'){
  17.             assert(fi==-1);
  18.             is_neg=true;
  19.             continue;
  20.         }
  21.         if('0'<=g && g<='9'){
  22.             x*=10;
  23.             x+=g-'0';
  24.             if(cnt==0){
  25.                 fi=g-'0';
  26.             }
  27.             cnt++;
  28.             assert(fi!=0 || cnt==1);
  29.             assert(fi!=0 || is_neg==false);
  30.  
  31.             assert(!(cnt>19 || ( cnt==19 && fi>1) ));
  32.         } else if(g==endd){
  33.             if(is_neg){
  34.                 x= -x;
  35.             }
  36.  
  37.             if(!(l <= x && x <= r))
  38.             {
  39.                 cerr << l << ' ' << r << ' ' << x << '\n';
  40.                 assert(1 == 0);
  41.             }
  42.  
  43.             return x;
  44.         } else {
  45.             assert(false);
  46.         }
  47.     }
  48. }
  49. string readString(int l,int r,char endd){
  50.     string ret="";
  51.     int cnt=0;
  52.     while(true){
  53.         char g=getchar();
  54.         assert(g!=-1);
  55.         if(g==endd){
  56.             break;
  57.         }
  58.         cnt++;
  59.         ret+=g;
  60.     }
  61.     assert(l<=cnt && cnt<=r);
  62.     return ret;
  63. }
  64. long long readIntSp(long long l,long long r){
  65.     return readInt(l,r,' ');
  66. }
  67. long long readIntLn(long long l,long long r){
  68.     return readInt(l,r,'\n');
  69. }
  70. string readStringLn(int l,int r){
  71.     return readString(l,r,'\n');
  72. }
  73. string readStringSp(int l,int r){
  74.     return readString(l,r,' ');
  75. }
  76.  
  77.  
  78. /*
  79. ------------------------Main code starts here----------------------------------
  80. */
  81.  
  82. const int MAX_T = 1e4;
  83. const int MAX_N = 1e5;
  84. const int MAX_SUM_LEN = 1e6;
  85. const int MAX_A = 1e9 ;
  86.  
  87. #define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
  88. #define ff first
  89. #define ss second
  90. #define mp make_pair
  91. #define ll long long
  92. #define rep(i,n) for(int i=0;i<n;i++)
  93. #define rev(i,n) for(int i=n;i>=0;i--)
  94. #define rep_a(i,a,n) for(int i=a;i<n;i++)
  95. #define pb push_back
  96.  
  97. int sum_n = 0;
  98. int max_n = 0;
  99. int yess = 0;
  100. int nos = 0;
  101. int total_ops = 0;
  102. ll mod = 1000000007;
  103.  
  104.  
  105. void solve()
  106. {   
  107.  
  108.     int n = readIntLn(1, MAX_N);
  109.     sum_n+=n;
  110.     max_n = max(max_n, n);
  111.  
  112.     ll a[n];
  113.  
  114.     rep(i,n){
  115.         if(i<n-1) a[i] = readIntSp(1, 1e9);
  116.         else a[i] = readIntLn(1, 1e9);
  117.     }
  118.  
  119.  
  120.     vector<ll> cnt(60) ;
  121.     for(int i = 0 ; i < n ; i++)
  122.     {
  123.         for(ll j = 35 ; j >= 0 ; j--)
  124.         {
  125.             if(((1LL << j) & a[i]) != 0)
  126.             {
  127.                 cnt[j]++ ;
  128.                 break ;
  129.             }
  130.         }
  131.     }
  132.  
  133.     ll ans = 0 ;
  134.     for(int i = 0 ; i <= 35 ; i++)
  135.     {
  136.         ans += ((cnt[i] * (cnt[i]-1))/2) ;
  137.     }
  138.     cout << ans << endl ;
  139.  
  140. }
  141.  
  142.  
  143. int main()
  144. {
  145.     ios_base::sync_with_stdio(0);
  146.     cin.tie(0); cout.tie(0);
  147.     #ifndef ONLINE_JUDGE
  148.     freopen("inputf.txt" , "r" , stdin) ;
  149.     freopen("outputf.txt" , "w" , stdout) ;
  150.     freopen("error.txt" , "w" , stderr) ;
  151.     #endif
  152.     
  153.     ll t ;
  154.     t = readIntLn(1,10000);
  155.  
  156.     for(int i=1;i<=t;i++)
  157.     {    
  158.         solve();
  159.     }
  160.     assert(getchar() == -1);
  161.     assert(sum_n<=1000000);
  162.     
  163.     
  164.     cerr<<"SUCCESS\n";
  165.     cerr<<"Sum of lengths : " << sum_n <<'\n';
  166.     cerr<<"Maximum length : " << max_n <<'\n';
  167.     // cerr<<"Total operations : " << total_ops << '\n';
  168.     //cerr<<"Answered yes : " << yess << '\n';
  169.     //cerr<<"Answered no : " << nos << '\n';
  170.  
  171.     return 0;
  172. }