#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
const long long MOD = 1000000007;
const int max_n = 3e5 + 100;
int a[max_n];
int n;
long long ans0 = 0;
long long ans = 0;
void Solve(int x, vector<vector<int>>& vc) {
  if (x < 0) return;
  vector<vector<int>> vn;
  long long res1 = 0, res2 = 0;
  for (int i = 0; i < vc.size(); ++i) {
    vector<int> v1, v2;
    long long cnt1 = 0, cnt2 = 0;
    for (int num : vc[i]) {
      if ((num >> x) & 1) {
        ++cnt1;
        res1 += cnt2;
        v1.push_back(num);
      } else {
        ++cnt2;
        res2 += cnt1;
        v2.push_back(num);
      }
    }
    if (!v1.empty()) vn.push_back(v1);
    if (!v2.empty()) vn.push_back(v2);
  }
  if (res1 < res2) {
    ans0 |= (1 << x);
    ans += res1;
  } else {
    ans += res2;
  }
  if (!vn.empty()) Solve(x - 1, vn);
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  vector<vector<int>> vc;
  vector<int> v;
  for (int i = 1; i <= n; ++i) {
    int num;
    cin >> num;
    v.push_back(num);
  }
  vc.push_back(v);
  Solve(31, vc);
  cout << ans << " " << ans0 << endl;
}
