#include <cstdio>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <cstring>
#include <array>
#include <algorithm>
#include <queue>
#include <vector>
#include <bitset>
#include <ctime>
#include <cstdlib>
#include <random>
#include <set>
#include <ctime>
#include <map>
#include <stack>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
#define reg register
#define fo(a,b,c) for(reg ll a=b;a<=c;++a)
#define re(a,b,c) for(reg ll a=b;a>=c;--a)
#define pii pair<ll,ll>
#define fi first
#define pb push_back
#define se second
#define ite set<ll> ::iterator
using namespace std;
const ll mod=1e9+7;
inline ll gi()
{
	ll x = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9')
	{
		if (ch == '-')
			f = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9')
	{
		x = (x<<1) + (x<<3) + (ch^48);
		ch = getchar();
	}
	return x * f;
}
ll _=1;
const ll inf=1e17+5;
const ll N=100005;
ll a[N],pr[N],sf[N],lim=(1ll<<31)-1,ans=0,n;
void go()
{
	pr[0]=lim,sf[n+1]=lim;
	fo(i,1,n)
	{
		pr[i]=pr[i-1]&a[i];
	}
	re(i,n,1)
	{
		sf[i]=sf[i+1]&a[i];
	}
	fo(i,1,n-1)
	{
		ans=max(ans,pr[i]+sf[i+1]);
	}
}
void wk(ll id)
{
	pr[0]=lim,sf[n+1]=a[id];
	fo(i,1,n)
	{
		if(i==id)
		{
			pr[i]=pr[i-1];
			continue;
		}
		pr[i]=pr[i-1]&a[i];
	}
	re(i,n,1)
	{
		sf[i]=sf[i+1]&a[i];
	}
	for(ll l=id,r;l<=n;l=r+1)
	{
		r=l+1;
		while(sf[r+1]==sf[l+1]) r++;
		fo(i,l,n)
		{
			ans=max(ans,(pr[l]&a[l])+sf[l+1]);
		}
	}
}
void sol()
{
	ans=0;
	vector<ll> z,y;
	n=gi();
	fo(i,1,n) a[i]=gi();
	go();
	pr[0]=lim,sf[n+1]=lim;
	fo(i,1,n)
	{
		pr[i]=pr[i-1]&a[i];
		if(pr[i]!=pr[i-1])
		{
			z.pb(i);
		}
	}
	re(i,n,1)
	{
		sf[i]=sf[i+1]&a[i];
		if(sf[i]!=sf[i+1])
		{
			y.pb(i);
		}
	}
	for(ll id1:z)
	{
		for(ll id2:y)
		{
			swap(a[id1],a[id2]);
			go();
			swap(a[id1],a[id2]);
		}
	}
	for(ll id1:z)
	{
		wk(id1);
	}
	reverse(a+1,a+1+n);
	for(ll id2:y)
	{
		wk(n-id2+1);
	}
	cout<<ans;
}
int main()
{
	_=gi();
	while(_--)
	{
		sol();
		printf("\n");
	}
	return 0;
}