#include #define show(x) cerr << #x << " = " << x << endl using namespace std; using ll = long long; using pii = pair; using vi = vector; template ostream& operator<<(ostream& os, const vector& v) { os << "sz:" << v.size() << "\n["; for (const auto& p : v) { os << p << ","; } os << "]\n"; return os; } template ostream& operator<<(ostream& os, const pair& p) { os << "(" << p.first << "," << p.second << ")"; return os; } constexpr ll MOD = 1e9 + 7; template constexpr T INF = numeric_limits::max() / 100; int main() { ll N; cin >> N; vector a(N); ll max_digits = 0; for (ll i = 0; i < N; i++) { cin >> a[i]; max_digits = max(max_digits, (ll)log2(a[i] - 1) + 1); } max_digits++; sort(a.begin(), a.end()); vector> digit(N, vector(max_digits, false)); for (ll i = 0; i < N; i++) { ll num = a[i]; for (ll j = 0; j < max_digits; j++) { digit[i][j] = (bool)(num % 2); num /= 2; } } vector same(max_digits, true); for (ll d = 0; d < max_digits; d++) { const bool first = digit[0][d]; for (ll i = 1; i < N; i++) { if (first != digit[i][d]) { same[d] = false; break; } } } ll mini = INF; for (ll i = 0; i < N; i++) { ll x = 0; ll maximum = 0; for (ll d = max_digits - 1; d >= 0; d--) { if (same[d]) { x += ((ll)digit[i][d] << d); } else { const ll inf = x; const ll sup = x + (1LL << (d + 1)) - 1; const ll cand = upper_bound(a.begin(), a.end(), sup) - lower_bound(a.begin(), a.end(), inf); if (cand == 0) { break; } x += ((ll)(not digit[i][d]) << d); maximum += 1LL << d; } } mini = min(mini, maximum); } cout << mini << endl; return 0; }