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;
using VI = vector<int>;
VI a[1 << 15];
VI b[1 << 15];
int x[100], y[100], n;
map<VI, int> mp;
int bpt[1 << 15];
int main() {
  scanf("%d", &n);
  for (int i = 0, z; i < n; i++) {
    scanf("%d", &z);
    x[i] = z & ((1 << 15) - 1);
    y[i] = z >> 15;
  }
  for (int i = 0; i < 1 << 15; i++) {
    bpt[i] = __builtin_popcount(i);
  }
  for (int B = 0; B < (1 << 15); B++) {
    a[B].resize(n);
    for (int i = 0; i < n; i++) {
      a[B][i] = bpt[B ^ x[i]];
    }
  }
  for (int B = 0; B < (1 << 15); B++) {
    b[B].resize(n);
    for (int i = 0; i < n; i++) {
      b[B][i] = bpt[B ^ y[i]];
    }
    mp[b[B]] = B;
  }
  for (int B = 0; B < 1 << 15; B++) {
    int mx = 0;
    for (int i = 0; i < n; i++) {
      mx = max(mx, bpt[B ^ x[i]]);
    }
    for (int c = 0; c <= 30 - mx; c++) {
      VI tmp(n);
      for (int i = 0; i < n; i++) {
        tmp[i] = mx + c - bpt[B ^ x[i]];
      }
      if (mp.count(tmp)) {
        printf("%d\n", B + (mp[tmp] << 15));
        return 0;
      }
    }
  }
  puts("-1");
  return 0;
}
