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 int MAXN = 105, B = 1 << 15;
const long long P = 67, m1 = 1e9 + 7, m2 = 1e9 + 9;
int a[MAXN], al[MAXN], ar[MAXN];
int del[MAXN];
struct Node {
  int va, vb, vx;
  Node() {}
  Node(int va_, int vb_, int vx_) { va = va_, vb = vb_, vx = vx_; }
  bool operator<(const Node& y) const {
    return va == y.va ? vb < y.vb : va < y.va;
  }
  bool operator==(const Node& y) const { return va == y.va && vb == y.vb; }
};
set<Node> st;
Node getVal(int arr[], int n, int x) {
  long long t1 = 1, t2 = 1, sa = 0, sb = 0;
  for (int i = 1; i <= n; ++i) {
    sa = (sa + t1 * arr[i]) % m1;
    sb = (sb + t2 * arr[i]) % m2;
    t1 = t1 * P % m1, t2 = t2 * P % m2;
  }
  return Node(sa, sb, x);
}
inline int countB(int n) {
  int res = 0;
  while (n) n -= n & -n, ++res;
  return res;
}
int main() {
  int N;
  scanf("%d", &N);
  for (int i = 1; i <= N; ++i) {
    scanf("%d", &a[i]);
    al[i] = a[i] / B, ar[i] = a[i] & (B - 1);
  }
  for (int x = 0, tmp; x < B; ++x) {
    tmp = countB(al[1] ^ x);
    for (int i = 2; i <= N; ++i) del[i - 1] = 30 + countB(al[i] ^ x) - tmp;
    st.insert(getVal(del, N - 1, x));
  }
  int ans = -1;
  set<Node>::iterator it;
  for (int x = 0, tmp; x < B; ++x) {
    tmp = countB(ar[1] ^ x);
    for (int i = 2; i <= N; ++i) del[i - 1] = 30 + tmp - countB(ar[i] ^ x);
    it = st.find(getVal(del, N - 1, x));
    if (it != st.end()) ans = it->vx * B + x;
  }
  printf("%d", ans);
  return 0;
}
