#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
const int mod = 51061;
const int maxn = 6e5 + 10;
const int inf = 0x3f3f3f3f;
int cnt = 1, ch[maxn << 4][2], val[maxn << 4];
int root = 1;
ll ans[30][2];
void ins(int k, int x, int dep) {
  if (dep < 0) return;
  int now = x & (1 << dep);
  now = !!now;
  if (!ch[k][now]) ch[k][now] = ++cnt;
  if (now) {
    ans[dep][1] += val[ch[k][0]];
  } else {
    ans[dep][0] += val[ch[k][1]];
  }
  val[ch[k][now]]++;
  ins(ch[k][now], x, dep - 1);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  for (int i = (1); i <= (int)(n); i++) {
    int x;
    cin >> x;
    ins(1, x, 30);
  }
  ll sum = 0, v = 0;
  for (int i = (0); i <= (int)(30); i++) {
    if (ans[i][0] <= ans[i][1]) {
      sum += ans[i][0];
    } else {
      sum += ans[i][1];
      v += (1 << i);
    }
  }
  cout << sum << ' ' << v << '\n';
  return 0;
}
