t = int(input())
for _ in range(t):
n = int(input())
lis = list(map(int, input().split()))
ans = 0
for i in lis:
ans |= i
print(ans)#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//const ll mod = 1e9 + 9;
const ll len = 4e7 + 1;
//const ll len1 = 1e8;
#define pb push_back
int a[100010];
void sol() {
ll i, j = 0, n, ans = 0, k = 0, m, p, q, w, e, r;
cin >> n;
for (i = 0; i < n; i++) {
cin >> q;
k |= q;
}
cout << k << "\n";
}
int main() {
//#pragma comment(linker, "/STACK:1073741824")
//#pragma warning(disable : 4996)
ios;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
sol();
}
return 0;
}406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |
377. Combination Sum IV | 322. Coin Change |
307. Range Sum Query - Mutable | 287. Find the Duplicate Number |
279. Perfect Squares | 275. H-Index II |
274. H-Index | 260. Single Number III |
240. Search a 2D Matrix II | 238. Product of Array Except Self |
229. Majority Element II | 222. Count Complete Tree Nodes |
215. Kth Largest Element in an Array | 198. House Robber |
153. Find Minimum in Rotated Sorted Array | 150. Evaluate Reverse Polish Notation |
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |