#include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
// Cope Counter = at least 125

ll n;
ll arr[100001], kms[18][100001];
map<ll, vector<ll>> bk;

ll wxzs(ll l, ll r) {
  for(ll i = 17; i >= 0; i--) {
    if(r - l + 1 >= (1 << i)) return kms[i][l] & kms[i][r - (1 << i) + 1];
  }
  return (1 << 30) - 1;
}
ll qry(ll type, ll val, ll i) {
  if(bk[val].empty()) {
    vector<ll> cancer(n);
    if(!type) {
      cancer[0] = arr[0] & val;
      for(ll j = 1; j < n; j++) cancer[j] = max(cancer[j - 1], arr[j] & val);
    } else {
      cancer[n - 1] = arr[n - 1] & val;
      for(ll j = n - 2; j >= 0; j--) cancer[j] = max(cancer[j + 1], arr[j] & val);
    }
    bk[val] = cancer;
  }
  return bk[val][i];
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
  ll t;
  cin >> t;
  while(t--) {
    cin >> n;
    for(ll i = 0; i < n; i++) {
      cin >> arr[i];
      kms[0][i] = arr[i];
    }
    for(ll i = 0; i < 17; i++) {
      for(ll j = 0; j + (1 << i) < n; j++) {
        kms[i + 1][j] = kms[i][j] & kms[i][j + (1 << i)];
      }
    }
    vector<ll> sped[2];
    sped[0].push_back(0), sped[1].push_back(n - 1);
    ll pre = arr[0], suf = arr[n - 1], ans = 0;
    for(ll i = 1; i < n; i++) {
      ans = max(ans, wxzs(0, i - 1) + wxzs(i, n - 1));
      if((pre & arr[i]) != pre) {
        pre &= arr[i];
        sped[0].push_back(i);
      }
      if((suf & arr[n - i - 1]) != suf) {
        suf &= arr[n - i - 1];
        sped[1].push_back(n - i - 1);
      }
    }
    for(ll k = 1; k < n; k++) {
      for(ll i : sped[0]) {
        if(i >= k) break;
        for(ll j : sped[1]) {
          if(j < k) break;
          ans = max(ans, (wxzs(0, i - 1) & arr[j] & wxzs(i + 1, k - 1)) + (wxzs(k, j - 1) & arr[i] & wxzs(j + 1, n - 1)));
        }
      }
    }
    for(ll thing = 0; thing < 2; thing++) {
      bk.clear();
      for(ll k = 1; k < n; k++) {
        for(ll i : sped[thing]) {
          if((!thing && i >= k) || (thing && i < k)) break;
          ans = max(ans, qry(thing, wxzs(0, i - 1) & wxzs(i + 1, k - 1), k) + wxzs(k, n - 1) & arr[i]);
        }
      }
    }
    cout << ans << "\n";
  }
}