#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
struct chash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
int main() {
  long long sum = 0;
  int n, a, m, k, b, c, d, p, r, i, Ans = 0, mask = 0;
  cin >> n;
  vector<int> A(n);
  for (int i = 0; i < n; i++) scanf("%i", &A[i]);
  for (int i = 1 << 29; i; i >>= 1) {
    mask |= i;
    long long q10 = 0, q01 = 0;
    static unordered_map<int, int> M;
    M.reserve(3e5);
    for (int j = 0; j < n; j++) {
      M[A[j] & mask]++;
      ((A[j] & i) ? q01 : q10) += M[(A[j] ^ i) & mask];
    }
    M.clear();
    if (q10 > q01) Ans |= i;
    sum += min(q10, q01);
  }
  cout << sum << " " << Ans;
  return 0;
}
