#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long sum = 0, ff = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') ff = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') sum = sum * 10 + ch - '0', ch = getchar();
  return sum * ff;
}
const int N = 5e6 + 7;
const int maxbit = 31;
int n, cnt, x;
long long f[N][3], num;
struct tree {
  int son[3];
} t[N];
vector<int> v[N];
void insert(int val, int pos) {
  int now = 0;
  for (int i = maxbit; i >= 0; i--) {
    bool bit = ((val >> i) & 1);
    if (!t[now].son[bit]) t[now].son[bit] = ++cnt;
    now = t[now].son[bit], v[now].push_back(pos);
  }
}
void dfs(int now, int bit) {
  int l = t[now].son[0], r = t[now].son[1];
  if (l) dfs(l, bit - 1);
  if (r) dfs(r, bit - 1);
  if (!l && !r) return;
  long long sum = 0;
  int pos = 0;
  for (int i = 0; i < v[l].size(); i++) {
    int x = v[l][i];
    while (pos < v[r].size() && v[r][pos] < x) pos++;
    sum += pos;
  }
  f[bit][0] += sum, f[bit][1] += 1ll * v[l].size() * v[r].size() - sum;
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) {
    int val = read();
    insert(val, i);
  }
  dfs(0, maxbit);
  for (int i = 0; i <= maxbit; i++) {
    num += min(f[i][0], f[i][1]);
    if (f[i][1] < f[i][0]) x += (1 << i);
  }
  cout << num << " " << x;
  return 0;
}
