Let's call two numbers similar if their binary representations contain the same number of digits equal to 1. For example:

  * 2 and 4 are similar (binary representations are 10 and 100); 
  * 1337 and 4213 are similar (binary representations are 10100111001 and 1000001110101); 
  * 3 and 2 are not similar (binary representations are 11 and 10); 
  * 42 and 13 are similar (binary representations are 101010 and 1101). 



You are given an array of n integers a_1, a_2, ..., a_n. You may choose a non-negative integer x, and then get another array of n integers b_1, b_2, ..., b_n, where b_i = a_i ⊕ x (⊕ denotes bitwise XOR).

Is it possible to obtain an array b where all numbers are similar to each other?

Input

The first line contains one integer n (2 ≤ n ≤ 100).

The second line contains n integers a_1, a_2, ..., a_n (0 ≤ a_i ≤ 2^{30} - 1).

Output

If it is impossible to choose x so that all elements in the resulting array are similar to each other, print one integer -1.

Otherwise, print any non-negative integer not exceeding 2^{30} - 1 that can be used as x so that all elements in the resulting array are similar.

Examples

Input


2
7 2


Output


1


Input


4
3 17 6 0


Output


5


Input


3
1 2 3


Output


-1


Input


3
43 12 12


Output


1073709057
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  map<vector<int>, int> S;
  for (int bit = 0; bit < (1 << 15); bit++) {
    vector<int> b(n);
    for (int i = 0; i < n; i++) {
      int c = a[i] ^ bit;
      for (int j = 0; j < 15; j++) {
        if (c & (1 << j)) b[i]++;
      }
    }
    vector<int> vec(n - 1);
    for (int i = 1; i < n; i++) {
      vec[i - 1] = b[i] - b[0];
    }
    S[vec] = bit;
  }
  for (int bit = 0; bit < (1 << 15); bit++) {
    vector<int> b(n);
    for (int i = 0; i < n; i++) {
      int c = a[i] ^ (bit << 15);
      for (int j = 15; j < 30; j++) {
        if (c & (1 << j)) b[i]++;
      }
    }
    vector<int> vec(n - 1);
    for (int i = 1; i < n; i++) {
      vec[i - 1] = b[0] - b[i];
    }
    if (S.find(vec) != S.end()) {
      cout << (bit << 15) + S[vec] << endl;
      return 0;
    }
  }
  cout << -1 << endl;
}
