#include <bits/stdc++.h>
using namespace std;
vector<long long> p(300000);
vector<long long> sz(300000, 1);
long long root(long long v) {
  if (v != p[v]) p[v] = root(p[v]);
  return p[v];
}
bool unite(long long a, long long b) {
  a = root(a);
  b = root(b);
  if (a == b) return 0;
  if (sz[a] < sz[b]) {
    p[a] = b;
    sz[b] += sz[a];
  } else {
    p[b] = a;
    sz[a] += sz[b];
  }
  return 1;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  vector<long long> a(n), zeros(n), ones(n);
  vector<pair<long long, long long>> s;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    s.emplace_back(a[i], i);
    p[i] = i;
  }
  sort(s.begin(), s.end());
  for (long long i = 1; i < n; i++) {
    if (s[i].first == s[i - 1].first) {
      unite(s[i].second, s[i - 1].second);
    }
  }
  long long ans = 0;
  long long x = 0;
  for (long long bit = 0; bit <= 30; bit++) {
    s.clear();
    long long s0 = 0;
    long long s1 = 0;
    for (long long i = 0; i < n; i++) {
      long long pref = a[i] >> (bit + 1ll);
      s.emplace_back(pref, i);
    }
    sort(s.begin(), s.end());
    for (long long i = 1; i < n; i++) {
      if (s[i].first == s[i - 1].first) {
        unite(s[i].second, s[i - 1].second);
      }
    }
    for (long long i = 0; i < n; i++) {
      long long rt = root(i);
      if (a[i] & (1ll << bit)) {
        s1 += zeros[rt];
        ones[rt]++;
      } else {
        s0 += ones[rt];
        zeros[rt]++;
      }
    }
    for (long long i = 0; i < n; i++) {
      ones[i] = 0;
      zeros[i] = 0;
    }
    if (s0 <= s1) {
      ans += s0;
    } else {
      ans += s1;
      x += (1ll << bit);
    }
  }
  cout << ans << ' ' << x;
  return 0;
}
