#include <bits/stdc++.h>
const int N = 300010;
int n, a[N];
int c[N];
int mi[N];
int m;
std::vector<int> vec[N];
class Discretization {
 public:
  Discretization() { vec_.clear(); }
  void Init() { vec_.clear(); }
  void Add(int x) { vec_.push_back(x); }
  void Build() {
    std::sort(vec_.begin(), vec_.end());
    vec_.erase(std::unique(vec_.begin(), vec_.end()), vec_.end());
  }
  int Id(int x) {
    auto y = std::lower_bound(vec_.begin(), vec_.end(), x);
    if (*y != x) {
      return -1;
    } else {
      return y - vec_.begin() + 1;
    }
  }
  int Size() { return vec_.size(); }

 private:
  std::vector<int> vec_;
};
Discretization disc;
int main() {
  mi[0] = 1;
  for (int i = 1; i <= 31; ++i) {
    mi[i] = mi[i - 1] << 1;
  }
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    c[i] = 0;
  }
  int ans_x = 0;
  long long ans_inv = 0ll;
  for (int i = 31; i >= 1; --i) {
    disc.Init();
    for (int j = 1; j <= n; ++j) {
      c[j] = (c[j] << 1) | ((a[j] & mi[i]) ? 1 : 0);
      disc.Add(c[j]);
    }
    disc.Build();
    m = disc.Size();
    for (int j = 1; j <= n; ++j) {
      int id = disc.Id(c[j]);
      int num = ((a[j] & mi[i - 1]) ? 1 : 0);
      vec[id].push_back(num);
    }
    long long num_inv_sum = 0ll;
    long long num_inc_sum = 0ll;
    for (int j = 1; j <= m; ++j) {
      long long cnt1 = 0ll;
      long long num_inv = 0ll;
      long long num_inc = 0ll;
      long long cnt0 = 0ll;
      for (size_t k = 0; k < vec[j].size(); ++k) {
        if (!vec[j][k]) {
          num_inv += cnt1;
          ++cnt0;
        } else {
          num_inc += cnt0;
          ++cnt1;
        }
      }
      num_inv_sum += num_inv;
      num_inc_sum += num_inc;
    }
    if (num_inc_sum - num_inv_sum < 0) {
      ans_x |= mi[i - 1];
      ans_inv += num_inc_sum;
    } else {
      ans_inv += num_inv_sum;
    }
    for (int j = 1; j <= m; ++j) {
      vec[j].clear();
    }
  }
  printf("%lld %d\n", ans_inv, ans_x);
  return 0;
}
