#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
void debug3(int *t, int st, int n) {
  cerr << '{' << t[st];
  for (int i = st + 1; i <= n; i++) cerr << ",", __print(t[i]);
  cerr << "}" << '\n';
}
int v[300005];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, i, msk = 0, j, x = 0;
  long long a1, a0, s = 0;
  cin >> n;
  for (i = 1; i <= n; i++) cin >> v[i];
  for (i = (1 << 29); i >= 1; i = i >> 1) {
    msk = msk | i;
    a1 = a0 = 0;
    static unordered_map<int, int> mp;
    for (j = 1; j <= n; j++) {
      mp[v[j] & msk]++;
      if ((v[j] & i))
        a0 += mp[(v[j] ^ i) & msk];
      else
        a1 += mp[(v[j] ^ i) & msk];
    }
    mp.clear();
    if (a0 < a1) x = x | i;
    s += min(a0, a1);
  }
  cout << s << " " << x;
}
