#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const double pi = acos(-1);
const int inf = 2e9;
const int maxn = 3e5 + 15;
int read() {
  char ch = getchar();
  int x = 0, f = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while ('0' <= ch && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int a[maxn];
int b[maxn];
int c[maxn];
int p[maxn];
int d;
int n;
void add(int x) {
  for (int i = x; d >= i; i += i & -i) {
    c[i]++;
  }
}
int query(int x) {
  int ans = 0;
  for (long long i = x; i; i -= i & -i) {
    ans += c[i];
  }
  return ans;
}
long long ans;
int pos[maxn];
void solve(int t, int num, long long preans1) {
  if (t == -1) {
    printf("%lld %d\n", ans, num);
    return;
  }
  long long ans2 = 0;
  int val = num + (1 << t);
  for (int i = 1; n >= i; ++i) {
    b[i] = a[i] ^ val;
    p[i] = b[i];
    c[i] = 0;
  }
  sort(p + 1, p + n + 1);
  d = unique(p + 1, p + n + 1) - p - 1;
  int tmp = n % 2;
  for (int i = 1; tmp >= i; ++i) {
    pos[i] = lower_bound(p + 1, p + d + 1, b[i]) - p;
  }
  for (int i = 1 + tmp; n >= i; i += 2) {
    pos[i] = lower_bound(p + 1, p + d + 1, b[i]) - p;
    pos[i + 1] = lower_bound(p + 1, p + d + 1, b[i + 1]) - p;
  }
  for (int i = n; i >= 1; --i) {
    if (pos[i] - 1 >= 1) ans2 += query(pos[i] - 1);
    add(pos[i]);
    if (ans2 >= preans1) break;
  }
  ans = min(preans1, ans2);
  if (preans1 <= ans2) {
    solve(t - 1, num, preans1);
  } else {
    solve(t - 1, val, ans2);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; n >= i; ++i) {
    a[i] = read();
  }
  for (int i = 1; n >= i; ++i) {
    b[i] = a[i];
    p[i] = b[i];
    c[i] = 0;
  }
  long long ans1 = 0;
  sort(p + 1, p + n + 1);
  d = unique(p + 1, p + n + 1) - p - 1;
  for (int i = n; i >= 1; --i) {
    int pos = lower_bound(p + 1, p + d + 1, b[i]) - p;
    if (pos - 1 >= 1) ans1 += query(pos - 1);
    add(pos);
  }
  solve(29, 0, ans1);
  return 0;
}
