#include <bits/stdc++.h>
using namespace std;
int temp[300005];
long long _mergeSort(int arr[], int temp[], int left, int right);
long long merge(int arr[], int temp[], int left, int mid, int right);
long long mergeSort(int arr[], int array_size) {
  return _mergeSort(arr, temp, 0, array_size - 1);
}
long long _mergeSort(int arr[], int temp[], int left, int right) {
  int mid;
  long long inv_count = 0;
  if (right > left) {
    mid = (right + left) / 2;
    inv_count += _mergeSort(arr, temp, left, mid);
    inv_count += _mergeSort(arr, temp, mid + 1, right);
    inv_count += merge(arr, temp, left, mid + 1, right);
  }
  return inv_count;
}
long long merge(int arr[], int temp[], int left, int mid, int right) {
  int i, j, k;
  long long inv_count = 0;
  i = left;
  j = mid;
  k = left;
  while ((i <= mid - 1) && (j <= right)) {
    if (arr[i] <= arr[j]) {
      temp[k++] = arr[i++];
    } else {
      temp[k++] = arr[j++];
      inv_count = inv_count + (mid - i);
    }
  }
  while (i <= mid - 1) temp[k++] = arr[i++];
  while (j <= right) temp[k++] = arr[j++];
  for (i = left; i <= right; i++) arr[i] = temp[i];
  return inv_count;
}
int a[300005];
int b[300005];
long long invCount(int a[], int n) {
  for (int i = 0; i < n; ++i) {
    b[i] = a[i];
  }
  return mergeSort(b, n);
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  bool fresh = true;
  long long ic0 = invCount(a, n);
  long long ans = 0;
  for (int bit = 29; bit >= 0; --bit) {
    if (!fresh) {
      ic0 = invCount(a, n);
      fresh = true;
    }
    for (int i = 0; i < n; ++i) {
      a[i] ^= (1 << bit);
    }
    long long ic1 = invCount(a, n);
    if (ic1 < ic0) {
      ans ^= (1 << bit);
      fresh = false;
      continue;
    }
    for (int i = 0; i < n; ++i) {
      a[i] ^= (1 << bit);
    }
  }
  cout << invCount(a, n) << " " << ans;
}
