#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x) {
  x = 0;
  int f = 1;
  char c = getchar();
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -1;
  for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48);
  if (f < 0) x = -x;
}
template <typename T>
inline void write(T x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
int n;
int a[300010];
int num = 0;
int ans = 0;
int stk[300010][35];
long long suml[35][2];
void work(int len, int now) {
  if (len <= 0) return;
  long long gs0 = 0, gs1 = 0, a1 = 0, a2 = 0;
  int top = 0;
  if (now >= 1) top = 0;
  for (int i = 1; i <= len; i++) {
    if ((a[stk[i][now]] >> now) & 1) {
      a1 += gs0;
      ++gs1;
      if (now >= 1) top++, stk[top][now - 1] = stk[i][now];
    } else {
      a2 += gs1;
      ++gs0;
    }
  }
  suml[now][1] += (long long)a1;
  suml[now][0] += (long long)a2;
  if (now == 0) return;
  work(top, now - 1);
  top = 0;
  for (int i = 1; i <= len; i++) {
    if (!((a[stk[i][now]] >> now) & 1)) top++, stk[top][now - 1] = stk[i][now];
  }
  work(top, now - 1);
  return;
}
int main() {
  read(n);
  int x = 0;
  for (int i = 1; i <= n; i++) {
    read(a[i]);
    x = max(x, a[i]);
  }
  int loc = 30;
  while (!((1 << loc) & x) && loc >= 1) loc--;
  int top = 0;
  for (int i = 1; i <= n; i++) {
    top++;
    stk[top][loc] = i;
  }
  work(top, loc);
  long long ans2 = 0ll;
  for (int i = 0; i <= loc; i++) {
    if (suml[i][0] <= suml[i][1]) {
      ans2 += suml[i][0];
    } else {
      ans2 += suml[i][1];
      ans |= (1 << i);
    }
  }
  write(ans2);
  putchar(' ');
  write(ans);
  putchar('\n');
  return 0;
}
