#include <bits/stdc++.h>
using namespace std;
template <class C>
void min_self(C &a, C b) {
  a = min(a, b);
}
template <class C>
void max_self(C &a, C b) {
  a = max(a, b);
}
const long long MOD = 1000000007;
long long mod(long long n, long long m = MOD) {
  n %= m, n += m, n %= m;
  return n;
}
const int MAXN = 1e5 + 5;
const int LOGN = 21;
const long long INF = 1e14;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
template <class T1, class T2>
void add(T1 &x, T2 y, long long m = MOD) {
  x += y;
  if (x >= m) x -= m;
}
template <class T1, class T2>
void sub(T1 &x, T2 y, long long m = MOD) {
  x -= y;
  if (x < 0) x += m;
}
vector<vector<int>> groups[32];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  vector<int> a(n);
  vector<int> temp;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    temp.push_back(i);
  }
  groups[31].push_back(temp);
  long long ans = 0, inversions = 0;
  for (long long bit = 31; bit >= 0; bit--) {
    long long pairs01 = 0, pairs10 = 0;
    for (auto v : groups[bit]) {
      int sz = v.size();
      vector<int> cnt(2, 0);
      vector<int> ones, zeros;
      for (int i = 0; i < sz; i++) {
        if ((a[v[i]] >> bit) & 1) {
          pairs01 += cnt[0];
          cnt[1]++;
          ones.push_back(v[i]);
        } else {
          pairs10 += cnt[1];
          cnt[0]++;
          zeros.push_back(v[i]);
        }
      }
      if (bit > 0) {
        if (!ones.empty()) groups[bit - 1].push_back(ones);
        if (!zeros.empty()) groups[bit - 1].push_back(zeros);
      }
    }
    if (pairs10 > pairs01) {
      ans |= (1 << bit);
    }
    inversions += min(pairs10, pairs01);
  }
  cout << inversions << " " << ans, cout << "\n";
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
