#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  template <class c>
  debug& operator<<(const c&) {
    return *this;
  }
};
const double pi = acosl(-1);
vector<vector<long long>> temp(31, vector<long long>(2));
long long ans = 0;
long long val = 0;
void rec(vector<long long> b, long long bit) {
  if (bit < 0 || b.size() == 0) return;
  long long m = b.size();
  vector<long long> one, zero;
  long long count0 = 0;
  long long count1 = 0;
  for (long long i = 0; i < (m); i++) {
    if (b[i] & (1 << bit)) {
      temp[bit][0] += count0;
      count1++;
      one.push_back(b[i]);
    } else {
      count0++;
      temp[bit][1] += count1;
      zero.push_back(b[i]);
    }
  }
  rec(one, bit - 1);
  rec(zero, bit - 1);
}
void solve() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < (n); i++) {
    cin >> a[i];
  }
  rec(a, 30);
  for (long long i = 30; i >= 0; i--) {
    ans += min(temp[i][0], temp[i][1]);
    if (temp[i][0] < temp[i][1]) {
      val |= (1 << i);
    }
  }
  cout << ans << ' ';
  cout << val << '\n';
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long tt = 1;
  while (tt--) {
    solve();
  }
}
