#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<long long> nums(n + 1);
vector<long long> count(30, 0);
for(int i = 1; i <= n; i++) {
cin >> nums[i];
for(int j = 0; j < 30; j++) {
count[j] = count[j] + ((nums[i] >> j) & 1);
}
}
long long ans = 0;
for(int i = 1; i <= n; i++) {
long long sum = 0;
for(int j = 0; j < 30; j++) {
bool flags = ((nums[i] >> j) & 1);
if(flags) {
sum = sum + (1 << j) * (n - count[j]);
}
else {
sum = sum + (1 << j) * count[j];
}
}
ans = max(ans, sum);
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while(t--) {
solve();
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdm9pZCBzb2x2ZSgpIHsKCQoJaW50IG47CgkKCWNpbiA+PiBuOwoJCgl2ZWN0b3I8bG9uZyBsb25nPiBudW1zKG4gKyAxKTsKCXZlY3Rvcjxsb25nIGxvbmc+IGNvdW50KDMwLCAwKTsKCQoJZm9yKGludCBpID0gMTsgaSA8PSBuOyBpKyspIHsKCQkKCQljaW4gPj4gbnVtc1tpXTsKCQkKCQlmb3IoaW50IGogPSAwOyBqIDwgMzA7IGorKykgewoJCQkKCQkJY291bnRbal0gPSBjb3VudFtqXSArICgobnVtc1tpXSA+PiBqKSAmIDEpOwoJCQkKCQl9CgkJCgl9CgkKCWxvbmcgbG9uZyBhbnMgPSAwOwoJCglmb3IoaW50IGkgPSAxOyBpIDw9IG47IGkrKykgewoJCQoJCWxvbmcgbG9uZyBzdW0gPSAwOwoJCQoJCWZvcihpbnQgaiA9IDA7IGogPCAzMDsgaisrKSB7CgkJCQoJCQlib29sIGZsYWdzID0gKChudW1zW2ldID4+IGopICYgMSk7CgkJCQoJCQlpZihmbGFncykgewoJCQkJCgkJCQlzdW0gPSBzdW0gKyAoMSA8PCBqKSAqIChuIC0gY291bnRbal0pOwoJCQkJCgkJCX0KCQkJCgkJCWVsc2UgewoJCQkJCgkJCQlzdW0gPSBzdW0gKyAoMSA8PCBqKSAqIGNvdW50W2pdOwoJCQkJCgkJCX0KCQkJCgkJfQoJCQoJCWFucyA9IG1heChhbnMsIHN1bSk7CgkJCgl9CgkKCWNvdXQgPDwgYW5zIDw8IGVuZGw7CgkKfQoKaW50IG1haW4oKSB7CgkKCWlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwoJY2luLnRpZSgwKTsKCQoJaW50IHQ7CgkKCWNpbiA+PiB0OwoJCgl3aGlsZSh0LS0pIHsKCQkKCQlzb2x2ZSgpOwoJCQoJfQoJCglyZXR1cm4gMDsKCQp9