#include <bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
inline int read() {
  register int res = 0;
  register char c = getchar(), f = 1;
  while (c < 48 || c > 57) {
    if (c == '-') f = 0;
    c = getchar();
  }
  while (c >= 48 && c <= 57)
    res = (res << 3) + (res << 1) + (c & 15), c = getchar();
  return f ? res : -res;
}
inline void write(long long x) {
  register char c[21], len = 0;
  if (!x) return putchar('0'), void();
  if (x < 0) x = -x, putchar('-');
  while (x) c[++len] = x % 10, x /= 10;
  while (len) putchar(c[len--] + 48);
}
const int N = 3e5 + 10;
int n, x, a[N];
long long ans;
struct node {
  int c0, c1;
  long long s0, s1;
};
unordered_map<int, node> mp;
int main() {
  n = read();
  for (int i = 1; i <= n; ++i) a[i] = read();
  for (int i = 29; ~i; --i) {
    mp.clear();
    for (int j = 1, o, t; j <= n; ++j) {
      o = a[j] >> i & 1, t = a[j] >> (i + 1);
      o ? (mp[t].s1 += mp[t].c0, ++mp[t].c1)
        : (mp[t].s0 += mp[t].c1, ++mp[t].c0);
    }
    long long s0 = 0, s1 = 0;
    for (auto p : mp) s0 += p.second.s0, s1 += p.second.s1;
    if (s0 > s1)
      x |= 1 << i, ans += s1;
    else
      ans += s0;
  }
  write(ans), putchar(' '), write(x), putchar('\n');
}
