#include <bits/stdc++.h>
using namespace std;
const long long mask = (1ll << 31) - 1;
const int N = 3e5 + 10;
int a[N], b[N], c[N], d[N], id[N];
vector<int> O, Z;
void add(int u, int d) {
  for (; u < N; u += u & -u) b[u] += d;
}
int calc(int u, int ans = 0) {
  for (; u > 0; u -= u & -u) ans += b[u];
  return ans;
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", a + i);
    id[i] = i;
  }
  long long inv = 0;
  int ans = 0;
  for (int i = 0; i < 31; i++) {
    for (int j = 1; j <= n; j++) {
      c[j] = a[j] & (mask << i + 1);
      d[j] = a[j] - c[j];
    }
    sort(id + 1, id + n + 1, [&](int x, int y) {
      if (c[x] != c[y]) return c[x] < c[y];
      return d[x] < d[y];
    });
    long long tot = 0, tmp = 0;
    for (int j = 1, k; j <= n; j = k) {
      O.clear();
      Z.clear();
      int zero = 0, one = 0;
      for (k = j; k <= n && c[id[j]] == c[id[k]]; k++) {
        if (d[id[k]] & (1 << i))
          one++, O.push_back(id[k]);
        else
          zero++, Z.push_back(id[k]);
      }
      for (auto r : O) add(r, 1);
      for (auto r : Z) tmp += calc(r);
      for (auto r : O) add(r, -1);
      tot += 1ll * zero * one;
    }
    if (tot - tmp < tmp) {
      ans ^= 1 << i;
    }
    inv += min(tot - tmp, tmp);
  }
  cout << inv << ' ' << ans << endl;
  return 0;
}
