#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &n) {
  T w = 1;
  n = 0;
  char ch = getchar();
  while (!isdigit(ch) && ch != EOF) {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (isdigit(ch) && ch != EOF) {
    n = (n << 1) + (n << 3) + (ch ^ 48);
    ch = getchar();
  }
  n *= w;
}
template <typename T>
inline void write(T x) {
  unsigned long long y = 0;
  T l = 0;
  if (x < 0) {
    x = -x;
    putchar('-');
  }
  if (!x) {
    putchar(48);
    return;
  }
  while (x) {
    y = y * 10 + x % 10;
    x /= 10;
    l++;
  }
  while (l) {
    putchar(y % 10 + 48);
    y /= 10;
    l--;
  }
}
template <typename T>
inline void writeln(T x) {
  write(x);
  puts("");
}
template <typename T>
inline void writes(T x) {
  write(x);
  putchar(' ');
}
template <typename T>
inline void checkmax(T &a, T b) {
  a = a > b ? a : b;
}
template <typename T>
inline void checkmin(T &a, T b) {
  a = a < b ? a : b;
}
int a[300100], c[300100], now[300100];
long long no;
inline void merge(int l, int r) {
  int mid = (l + r) >> 1;
  int i = l, j = mid + 1, p = l;
  for (; i <= mid && j <= r;)
    if (c[i] > c[j]) {
      no += mid - i + 1;
      now[p++] = c[j++];
    } else
      now[p++] = c[i++];
  while (i <= mid) now[p++] = c[i++];
  while (j <= r) now[p++] = c[j++];
  for (int i = (l); i <= (r); i++) c[i] = now[i];
}
inline void mergesort(int l, int r) {
  if (l >= r) return;
  int mid = (l + r) >> 1;
  mergesort(l, mid);
  mergesort(mid + 1, r);
  merge(l, r);
}
int main() {
  int n, ans = 0;
  read(n);
  for (int i = (1); i <= (n); i++) read(a[i]);
  for (int i = (30); i >= (0); i--) {
    int sum1 = 0, sum0 = 0;
    long long ni1 = 0, ni2 = 0;
    for (int j = (1); j <= (n); j++) c[j] = a[j];
    no = 0;
    mergesort(1, n);
    ni1 = no;
    for (int j = (1); j <= (n); j++) c[j] = a[j] ^ (1 << i);
    no = 0;
    mergesort(1, n);
    ni2 = no;
    if (ni1 > ni2) {
      for (int j = (1); j <= (n); j++) a[j] ^= (1 << i);
      ans += (1 << i);
    }
  }
  for (int i = (1); i <= (n); i++) c[i] = a[i];
  no = 0;
  mergesort(1, n);
  writes(no);
  writeln(ans);
  return 0;
}
