#include <bits/stdc++.h>
using namespace std;
long long int M = 1e9 + 7;
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
vector<long long int> getPrimeFactors(long long int n) {
  vector<long long int> to_return;
  while (n % 2 == 0) {
    to_return.push_back(2);
    n = n / 2;
  }
  for (long long int i = 3; i <= sqrt(n); i = i + 2) {
    while (n % i == 0) {
      to_return.push_back(i);
      n = n / i;
    }
  }
  if (n > 2) to_return.push_back(n);
  return to_return;
}
bool isStringPalindrome(string s) {
  long long int size = s.length();
  if (size == 1) return true;
  for (int i = 0; i <= (size - 1) / 2; i++) {
    if (s[i] != s[size - i - 1]) return false;
  }
  return true;
}
long long int factorial(long long int n) {
  if (n == 0) return 1;
  return n * factorial(n - 1);
}
long long int nCk(long long int n, long long int k) {
  return factorial(n) / (factorial(n - k) * factorial(k));
}
bool isPrime(long long int n) {
  for (long long int i = 2; i * i < n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
long long int lower(long long int n, long long int arr[], long long int low,
                    long long int high, long long int l) {
  long long int mid = low + (high - low) / 2;
  if (low > high) return -1;
  if (low == high) {
    if (arr[low] >= l)
      return low;
    else
      return -1;
  }
  if (arr[mid] >= l) {
    if (mid == 0) return mid;
    if (arr[mid - 1] >= l)
      return lower(n, arr, low, mid - 1, l);
    else
      return mid;
  } else {
    return lower(n, arr, mid + 1, high, l);
  }
}
long long int higher(long long int n, long long int arr[], long long int low,
                     long long int high, long long int r) {
  long long int mid = floor(low + (high - low) / 2);
  if (low > high) return -1;
  if (low == high) {
    if (arr[low] <= r)
      return low;
    else
      return -1;
  }
  if (arr[mid] <= r) {
    if (mid == n - 1) return mid;
    if (arr[mid + 1] <= r)
      return higher(n, arr, mid + 1, high, r);
    else
      return mid;
  } else {
    return higher(n, arr, low, mid - 1, r);
  }
}
long long int lcm(long long int n) {
  if (n == 1) return 1;
  long long int k = lcm(n - 1);
  return n * k / gcd(n, k);
}
long long int binSearch(long long int arr[], long long int low,
                        long long int high, long long int a) {
  long long int mid = floor(low + (high - low) / 2);
  if (arr[mid] == a)
    return mid;
  else if (arr[mid] < a)
    return binSearch(arr, mid + 1, high, a);
  else
    return binSearch(arr, low, mid - 1, a);
}
long long int f(long long int n) { return n * (n + 1) / 2; }
void swap(long long int arr[], long long int ind1, long long int ind2) {
  long long int tmp = arr[ind2];
  arr[ind2] = arr[ind1];
  arr[ind1] = tmp;
}
long long int power(long long int n) {
  long long int x = 1;
  for (int i = 0; i < n; i++) {
    x *= 2;
    x = x % M;
  }
  return x % M;
}
void solve(int t) {
  long long int n;
  cin >> n;
  long long int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  long long int ans = arr[0];
  for (int i = 1; i < n; i++) {
    ans = (ans & arr[i]);
  }
  cout << ans << endl;
}
int main() {
  int T;
  cin >> T;
  for (int t = 1; t <= T; t++) solve(t);
}

### Prompt

Generate a cpp solution to the following problem:

Mocha is a young girl from high school. She has learned so much interesting knowledge from her teachers, especially her math teacher. Recently, Mocha is learning about binary system and very interested in bitwise operation.

This day, Mocha got a sequence a of length n. In each operation, she can select an arbitrary interval [l, r] and for all values i (0≤ i ≤ r-l), replace a_{l+i} with a_{l+i}  \&  a_{r-i} at the same time, where \& denotes the [bitwise AND operation](https://en.wikipedia.org/wiki/Bitwise_operation#AND). This operation can be performed any number of times.

For example, if n=5, the array is [a_1,a_2,a_3,a_4,a_5], and Mocha selects the interval [2,5], then the new array is [a_1,a_2 \&  a_5, a_3 \&  a_4, a_4 \&  a_3, a_5 \&  a_2].

Now Mocha wants to minimize the maximum value in the sequence. As her best friend, can you help her to get the answer?

Input

Each test contains multiple test cases. 

The first line contains a single integer t (1 ≤ t ≤ 100) — the number of test cases. Each test case consists of two lines.

The first line of each test case contains a single integer n (1 ≤ n ≤ 100) — the length of the sequence.

The second line of each test case contains n integers a_1, a_2, …, a_n (0 ≤ a_i ≤ 10^9).

Output

For each test case, print one integer — the minimal value of the maximum value in the sequence.

Example

Input


4
2
1 2
3
1 1 3
4
3 11 3 7
5
11 7 15 3 7


Output


0
1
3
3

Note

In the first test case, Mocha can choose the interval [1,2], then the sequence becomes [ 0, 0], where the first element is 1 \& 2, and the second element is 2 \& 1.

In the second test case, Mocha can choose the interval [1,3], then the sequence becomes [ 1,1,1], where the first element is 1 \& 3, the second element is 1 \& 1, and the third element is 3 \& 1.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long int M = 1e9 + 7;
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
vector<long long int> getPrimeFactors(long long int n) {
  vector<long long int> to_return;
  while (n % 2 == 0) {
    to_return.push_back(2);
    n = n / 2;
  }
  for (long long int i = 3; i <= sqrt(n); i = i + 2) {
    while (n % i == 0) {
      to_return.push_back(i);
      n = n / i;
    }
  }
  if (n > 2) to_return.push_back(n);
  return to_return;
}
bool isStringPalindrome(string s) {
  long long int size = s.length();
  if (size == 1) return true;
  for (int i = 0; i <= (size - 1) / 2; i++) {
    if (s[i] != s[size - i - 1]) return false;
  }
  return true;
}
long long int factorial(long long int n) {
  if (n == 0) return 1;
  return n * factorial(n - 1);
}
long long int nCk(long long int n, long long int k) {
  return factorial(n) / (factorial(n - k) * factorial(k));
}
bool isPrime(long long int n) {
  for (long long int i = 2; i * i < n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
long long int lower(long long int n, long long int arr[], long long int low,
                    long long int high, long long int l) {
  long long int mid = low + (high - low) / 2;
  if (low > high) return -1;
  if (low == high) {
    if (arr[low] >= l)
      return low;
    else
      return -1;
  }
  if (arr[mid] >= l) {
    if (mid == 0) return mid;
    if (arr[mid - 1] >= l)
      return lower(n, arr, low, mid - 1, l);
    else
      return mid;
  } else {
    return lower(n, arr, mid + 1, high, l);
  }
}
long long int higher(long long int n, long long int arr[], long long int low,
                     long long int high, long long int r) {
  long long int mid = floor(low + (high - low) / 2);
  if (low > high) return -1;
  if (low == high) {
    if (arr[low] <= r)
      return low;
    else
      return -1;
  }
  if (arr[mid] <= r) {
    if (mid == n - 1) return mid;
    if (arr[mid + 1] <= r)
      return higher(n, arr, mid + 1, high, r);
    else
      return mid;
  } else {
    return higher(n, arr, low, mid - 1, r);
  }
}
long long int lcm(long long int n) {
  if (n == 1) return 1;
  long long int k = lcm(n - 1);
  return n * k / gcd(n, k);
}
long long int binSearch(long long int arr[], long long int low,
                        long long int high, long long int a) {
  long long int mid = floor(low + (high - low) / 2);
  if (arr[mid] == a)
    return mid;
  else if (arr[mid] < a)
    return binSearch(arr, mid + 1, high, a);
  else
    return binSearch(arr, low, mid - 1, a);
}
long long int f(long long int n) { return n * (n + 1) / 2; }
void swap(long long int arr[], long long int ind1, long long int ind2) {
  long long int tmp = arr[ind2];
  arr[ind2] = arr[ind1];
  arr[ind1] = tmp;
}
long long int power(long long int n) {
  long long int x = 1;
  for (int i = 0; i < n; i++) {
    x *= 2;
    x = x % M;
  }
  return x % M;
}
void solve(int t) {
  long long int n;
  cin >> n;
  long long int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  long long int ans = arr[0];
  for (int i = 1; i < n; i++) {
    ans = (ans & arr[i]);
  }
  cout << ans << endl;
}
int main() {
  int T;
  cin >> T;
  for (int t = 1; t <= T; t++) solve(t);
}

```