#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 5;
int n, m, k;
int a[maxn], c[maxn], b[maxn];
long long ans, tmp, cnt, sum;
int flag;
char s[maxn];
bool ok[maxn];
template <typename T>
inline void read(T &X) {
  X = 0;
  int w = 0;
  char ch = 0;
  while (!isdigit(ch)) {
    w |= ch == '-';
    ch = getchar();
  }
  while (isdigit(ch)) X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
  if (w) X = -X;
}
void Merge(int begin, int mid, int end) {
  int i = begin, j = mid + 1, pos = begin;
  while (i <= mid && j <= end) {
    if (a[i] <= a[j]) {
      b[pos++] = a[i++];
    } else {
      b[pos++] = a[j++];
      sum += mid - i + 1;
    }
  }
  while (i <= mid) b[pos++] = a[i++];
  while (j <= end) b[pos++] = a[j++];
  for (int i = begin, j = begin; i <= end; i++, j++) a[i] = b[j];
}
void Sort(int begin, int end) {
  if (begin < end) {
    int mid = (begin + end) / 2;
    Sort(begin, mid);
    Sort(mid + 1, end);
    Merge(begin, mid, end);
  }
}
void solve() {
  read(n);
  for (int i = (1); i <= (n); i++) {
    read(c[i]);
  }
  int x = 0;
  int tmp = 0;
  for (int i = (30); i >= (0); i--) {
    tmp |= (1 << i);
    for (int j = (1); j <= (n); j++) a[j] = (c[j] & tmp);
    sum = 0;
    Sort(1, n);
    long long sum1 = sum;
    sum = 0;
    for (int j = (1); j <= (n); j++) a[j] = (c[j] & tmp) ^ (1 << i);
    Sort(1, n);
    if (sum1 <= sum) continue;
    x |= (1 << i);
    for (int j = (1); j <= (n); j++) c[j] ^= (1 << i);
  }
  sum = 0;
  for (int i = (1); i <= (n); i++) a[i] = c[i];
  Sort(1, n);
  printf("%lld %d\n", sum, x);
}
int main() {
  int T = 1, cas = 1;
  while (T--) {
    solve();
  }
  return 0;
}
