#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 127

ll arr[100001], kms[18][100001];

ll qry(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;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	ll t;
  cin >> t;
  while(t--) {
    ll n;
    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)];
      }
    }
    ll smax = 0;
    for(ll i = 1; i < n; i++) smax = max(smax, qry(0, i - 1) + qry(i, n - 1));
    for(ll k = 1; k < n; k++) {
      for(ll i = 0; i < k; i++) {
        for(ll j = k; j < n; j++) {
          smax = max(smax, (qry(0, i - 1) & arr[j] & qry(i + 1, k - 1)) + (qry(k, j - 1) & arr[i] & qry(j + 1, n - 1)));
        }
      }
    }
    cout << smax << "\n";
  }
}