#include <bits/stdc++.h>
using namespace std;
long long int ans[30][2];
void rec(vector<long long int> &a, long long int bit) {
  vector<long long int> nxt[2];
  vector<long long int> cnt(2, 0);
  for (long long int i = 0; i < (long long int)a.size(); ++i) {
    if (a[i] & (1 << bit)) {
      cnt[1]++;
      ans[bit][0] += cnt[0];
      nxt[1].push_back(a[i] - (1 << bit));
    } else {
      cnt[0]++;
      ans[bit][1] += cnt[1];
      nxt[0].push_back(a[i]);
    }
  }
  if (bit == 0) return;
  if (!nxt[0].empty()) rec(nxt[0], bit - 1);
  if (!nxt[1].empty()) rec(nxt[1], bit - 1);
}
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> a(n);
  for (long long int i = 0; i < n; ++i) cin >> a[i];
  rec(a, 29);
  long long int a1 = 0, a2 = 0;
  for (long long int i = 0; i < 30; ++i) {
    a1 += min(ans[i][0], ans[i][1]);
    if (ans[i][0] < ans[i][1]) {
      a2 += (1 << i);
    }
  }
  cout << a1 << " " << a2 << '\n';
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  long long int T = 1;
  for (long long int i = 1; i <= T; ++i) {
    solve();
  }
  return 0;
}
