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

#define int long long
const int LOG = 22;
const int MAXN = 1e5 + 5;

int n;
int a[MAXN];
int st[LOG][MAXN];
int lg[MAXN];
vector<int> important;
map<int, vector<int>> bf;	// bruteforce

int qry(int l, int r) {
	if(l > r) return (1 << (LOG + 1)) - 1;

	int lgg = lg[r - l + 1];
	return st[lgg][l] & st[lgg][r - (1 << lgg) + 1];
}

void solve() {
	cin >> n;

	for(int i = 0; i < LOG; ++i) {
		for(int j = 0; j <= n; ++j) {
			st[i][j] = 0;
		}
	}

	for(int i = 1; i <= n; ++i) {
		cin >> a[i]; st[0][i] = a[i];
	}

	for(int h = 1; h < LOG; ++h) {
		for(int i = 1; i <= (n - (1 << h) + 1); ++i) {
			st[h][i] = st[h - 1][i] & st[h - 1][i + (1 << (h - 1))];
		}
	}

	vector<int> pref, suff;
	int mask = (1 << LOG) - 1;
	for(int i = 1; i <= n; ++i) {
		if(mask != (mask & a[i])) pref.push_back(i);
		mask = mask & a[i];
	}

	mask = (1 << LOG) - 1;
	for(int i = n; i >= 1; --i) {
		if(mask != (mask & a[i])) suff.push_back(i);
		mask = mask & a[i];
	}

	int ans = 0;
	for(int k = 1; k < n; ++k) {
		ans = max(ans, qry(1, k) + qry(k + 1, n));
	}

	for(int k = 1; k < n; ++k) {
		for(auto x : pref) {
			if(x > k) continue;

			for(auto y : suff) {
				if(y <= k) continue;

				ans = max(ans, (qry(1, x - 1) & qry(x + 1, k) & a[y]) + (qry(k + 1, y - 1) & qry(y + 1, n) & a[x]));
			}
		}
	}

	bf.clear();
	for(int k = 1; k < n; ++k) {
		for(auto x : pref) {
			if(x > k) continue;

			int prefv = qry(1, x - 1) & qry(x + 1, k);
			if(bf.count(prefv) == 0) {
				vector<int> vals(n + 2);

				for(int i = n; i >= 1; --i) {
					vals[i] = max(vals[i + 1], a[i] & prefv);
				}

				bf[prefv] = vals;
			}
			ans = max(ans, bf[prefv][k + 1] + (qry(k + 1, n) & a[x]));
		}
	}

	bf.clear();
	for(int k = 1; k < n; ++k) {
		for(auto y : suff) {
			if(y <= k) continue;

			int suffv = qry(k + 1, y - 1) & qry(y + 1, n);
			if(bf.count(suffv) == 0) {
				vector<int> vals(n + 2);

				for(int i = 1; i <= n; ++i) {
					vals[i] = max(vals[i - 1], a[i] & suffv);
				}

				bf[suffv] = vals;
			}
			ans = max(ans, bf[suffv][k] + (qry(1, k) & a[y]));
		}
	}

    cout << ans << '\n';
}

signed main() {
	lg[1] = 0;
	for(int i = 2; i <= MAXN; ++i) lg[i] = lg[i / 2] + 1;

	int t; cin >> t;
	while(t--) solve();
}