#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e5+5,M=N*40+5,K=600+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,A[N],suf[N],pre[N],ans,st[N][20];
int qry(int x,int y){if(x>y) return (1<<30)-1;int d=__lg(y-x+1);return st[x][d]&st[y-(1<<d)+1][d];}
void calc(int x,int k,int y){ans=max(ans,(qry(1,x-1)&A[y]&qry(x+1,k))+(qry(k+1,y-1)&A[x]&qry(y+1,n)));}
void Solve(){
	int i,j,h;scanf("%d",&n);
	for(i=1;i<=n;i++) scanf("%d",&A[i]);
	ans=0;
	pre[0]=(1<<30)-1;for(i=1;i<=n;i++) pre[i]=pre[i-1]&A[i];
	suf[n+1]=(1<<30)-1;for(i=n;i;i--) suf[i]=suf[i+1]&A[i];
	for(i=1;i<n;i++) ans=max(ans,pre[i]+suf[i+1]);
	for(i=n;i;i--){
		for(st[i][0]=A[i],j=1;i+(1<<j)-1<=n;j++) st[i][j]=st[i][j-1]&st[i+(1<<j-1)][j-1];
	}
	vector<int> a,b;
	for(i=1;i<=n;i++) if(pre[i]^pre[i-1]) a.emplace_back(i);
	for(i=n;i;i--) if(suf[i]^suf[i+1]) b.emplace_back(i);
	for(i=1;i<n;i++){
		for(int j:a) if(j<=i) for(int h:b) if(h>i) calc(j,i,h);
	}
	for(int i:a) {
		for(int j:b) if(i<=j+1&&j<n){
			for(h=j+2;h<=n;h++) calc(i,j+1,h);
		} 
	}
	for(int i:b){
		for(int j:a) if(j-1<i&&j>1){
			for(h=1;h<j;h++) calc(h,j-1,i);
		}
	}
	printf("%d\n",ans);
}
int main(){
	int t;
	scanf("%d",&t);
	// t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}