#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int n, a[N], pre[N], nxt[N], res;

void brute() {
    for (int i = 1; i <= n; ++i) {
        pre[i] = (i == 1 ? a[i] : a[i] & pre[i - 1]);
    }
    for (int i = n; i >= 1; --i) {
        nxt[i] = (i == n ? a[i] : a[i] & nxt[i + 1]);
    }
    for (int i = 1; i < n; ++i) {
        res = max(res, pre[i] + nxt[i + 1]);
    }
}

int f[N], g[N];
map< pair<int, int>, int> M;

int calcMax(int x) {
    int res = 0;
    for (int i = 1; i <= n; ++i) res = max(res, a[i] & x);
    return res;
}

void calc(int x) {
    if (x == n) return;
    int val = (1 << 30) - 1;
    for (int i = 1; i < x; ++i) val &= a[i];
    f[x] = val;
    for (int i = x + 1; i < n; ++i) {
        f[i] = f[i - 1] & a[i];
    }
    g[n + 1] = a[x];
    for (int i = n; i >= x; --i) {
        g[i] = g[i + 1] & a[i];
    }
    if (n <= 2000) {
        for (int j = x + 1; j <= n; ++j) {
            for (int k = x; k < j; ++k) {
                res = max(res, (f[k] & a[j]) + g[k + 1]);
            }
        }
    } else {

    }
}

void solve(vector<int> pre) {
    for (auto x : pre) calc(x);
}

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
        a[0] = a[n + 1] = 0;
        res = 0, brute();
        vector<int> Pre, Nxt;
        for (int i = 1; i <= n; ++i) {
            if (pre[i] != pre[i - 1]) Pre.push_back(i);
            if (nxt[i] != nxt[i + 1]) Nxt.push_back(i);
        }
        M.clear();
        solve(Pre);
        reverse(a + 1, a + n + 1);
        for (auto &x : Nxt) x = n - x + 1;
        solve(Nxt);
        for (auto &x : Nxt) x = n - x + 1;
        reverse(a + 1, a + n + 1);
        for (auto [x, y] : M) {
            res = max(res, calcMax(x.first) + x.second);
        }
        for (auto x : Pre) {
            for (auto y : Nxt) {
                swap(a[x], a[y]), brute(), swap(a[x], a[y]);
            }
        }
        printf("%d\n", res);
    }
    return 0;
}