#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define fr first
#define sc second
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int nmax = 500005;

const int mod = 1e9 + 7;

int t, n, a[nmax], ans, put[60], rasp[nmax];

vector <int> cnt[60];

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    //freopen("input.in", "r", stdin);
    put[0] = 1;
    for(int i=1;i<=59;i++) put[i] = 1LL * 2 * put[i - 1] % mod;
    cin >> t;
    while(t--){
        ans = 0;
        cin >> n;
        for(int i=1;i<=n;i++){
            cin >> a[i];
        }
        for(int i=0;i<60;i++) cnt[i].clear();
        for(int i=1;i<=n;i++) rasp[i] = 0;
        for(int i=0;i<60;i++){
            for(int j=1;j<=n;j++){
                if(a[j] & (1LL << i)){
                    cnt[i].push_back(j);
                }
            }
        }
        for(int i=1;i<=n;i++){
            for(int j=0;j<60;j++){
                if(a[i] & (1LL << j)){
                    rasp[i] = (rasp[i] + n * put[j] % mod) % mod;
                }
                else{
                    rasp[i] = (rasp[i] + (int)cnt[j].size() * put[j] % mod) % mod;
                }
            }
        }
        for(int i=0;i<=60;i++){
            int curr = 0;
            for(auto it : cnt[i]){
                curr = rasp[it];
                curr = curr * (put[i] % mod) % mod;
                curr = curr * (int)cnt[i].size() % mod;
                ans = (ans + curr) % mod;
            }
        }
        cout << ans << '\n';
    }
}
