#include<bits/stdc++.h>
using namespace std;

#define all(x) (x).begin(),(x).end()
#define pb push_back
#define pf push_front
#define sz(x) (int)(x).size()
#define lb lower_bound 
#define ub upper_bound 
#define mp make_pair
#define fi first
#define se second
#define setbits(x) __builtin_popcount(x)
#define zerobits(x) __builtin_ctz(x)
#define setbitsll(x) __builtin_popcountll(x)
#define zerobitsll(x) __builtin_ctzll(x)
#define ps(x,y) fixed<<setprecision(y)<<x

typedef vector<int> vi;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef unsigned long long ull;
typedef long double ld;
typedef map<int,int> mii;

const int MOD = 1e9+7;
const ld PI = acos((ld)-1);

void solve () {
	int n;
	cin >> n;
	vl arr(n),freq(60);
	for (int i = 0;i < n;++i) {
		cin >> arr[i];
		for (ll j = 0;j < 60;++j) {
			if (((arr[i] >> j) & 1)) {
				freq[j]++;
			}
		}
	}
	ll ans = 0;
	for (int i = 0;i < n;++i) {
		ll andOp = 0,orOp = 0;
		for (ll j = 0;j < 60;++j) {
			if (((arr[i] >> j) & 1)) {
				andOp = (andOp+(1ll << j)%MOD*freq[j]%MOD)%MOD;
				orOp = (orOp+(1ll << j)%MOD*n%MOD)%MOD;
			} else {
				orOp = (orOp+(1ll << j)%MOD*freq[j]%MOD)%MOD;
			}
		}
		ans = (ans+andOp*orOp%MOD)%MOD;
	}
	cout << ans << '\n';
}

int main () {

#ifndef ONLINE_JUDGE
	freopen("input1.txt","r",stdin);
	freopen("output1.txt","w",stdout);
#endif

	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}


### Prompt

Your challenge is to write a CPP solution to the following problem:

Only a few know that Pan and Apollo weren't only battling for the title of the GOAT musician. A few millenniums later, they also challenged each other in math (or rather in fast calculations). The task they got to solve is the following:

Let x_1, x_2, …, x_n be the sequence of n non-negative integers. Find this value: $$$∑_{i=1}^n ∑_{j=1}^n ∑_{k=1}^n (x_i   \&   x_j) ⋅ (x_j   |   x_k)$$$

Here \& denotes the [bitwise and,](https://en.wikipedia.org/wiki/Bitwise_operation#AND) and | denotes the [bitwise or.](https://en.wikipedia.org/wiki/Bitwise_operation#OR)

Pan and Apollo could solve this in a few seconds. Can you do it too? For convenience, find the answer modulo 10^9 + 7.

Input

The first line of the input contains a single integer t (1 ≤ t ≤ 1 000) denoting the number of test cases, then t test cases follow.

The first line of each test case consists of a single integer n (1 ≤ n ≤ 5 ⋅ 10^5), the length of the sequence. The second one contains n non-negative integers x_1, x_2, …, x_n (0 ≤ x_i < 2^{60}), elements of the sequence.

The sum of n over all test cases will not exceed 5 ⋅ 10^5.

Output

Print t lines. The i-th line should contain the answer to the i-th text case.

Example

Input


8
2
1 7
3
1 2 4
4
5 5 5 5
5
6 2 2 1 0
1
0
1
1
6
1 12 123 1234 12345 123456
5
536870912 536870911 1152921504606846975 1152921504606846974 1152921504606846973


Output


128
91
1600
505
0
1
502811676
264880351

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;

#define all(x) (x).begin(),(x).end()
#define pb push_back
#define pf push_front
#define sz(x) (int)(x).size()
#define lb lower_bound 
#define ub upper_bound 
#define mp make_pair
#define fi first
#define se second
#define setbits(x) __builtin_popcount(x)
#define zerobits(x) __builtin_ctz(x)
#define setbitsll(x) __builtin_popcountll(x)
#define zerobitsll(x) __builtin_ctzll(x)
#define ps(x,y) fixed<<setprecision(y)<<x

typedef vector<int> vi;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef unsigned long long ull;
typedef long double ld;
typedef map<int,int> mii;

const int MOD = 1e9+7;
const ld PI = acos((ld)-1);

void solve () {
	int n;
	cin >> n;
	vl arr(n),freq(60);
	for (int i = 0;i < n;++i) {
		cin >> arr[i];
		for (ll j = 0;j < 60;++j) {
			if (((arr[i] >> j) & 1)) {
				freq[j]++;
			}
		}
	}
	ll ans = 0;
	for (int i = 0;i < n;++i) {
		ll andOp = 0,orOp = 0;
		for (ll j = 0;j < 60;++j) {
			if (((arr[i] >> j) & 1)) {
				andOp = (andOp+(1ll << j)%MOD*freq[j]%MOD)%MOD;
				orOp = (orOp+(1ll << j)%MOD*n%MOD)%MOD;
			} else {
				orOp = (orOp+(1ll << j)%MOD*freq[j]%MOD)%MOD;
			}
		}
		ans = (ans+andOp*orOp%MOD)%MOD;
	}
	cout << ans << '\n';
}

int main () {

#ifndef ONLINE_JUDGE
	freopen("input1.txt","r",stdin);
	freopen("output1.txt","w",stdout);
#endif

	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}


```