//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
//#pragma GCC target("avx,avx2")
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")

//# include <x86intrin.h>
# include <bits/stdc++.h>

# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++)
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void setIO(string s = "") {
	// cin.exceptions(cin.failbit);
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 3e5 + 123;
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
mt19937 gen(chrono::steady_clock::now().time_since_epoch().count());

int rnd (int l, int r) {
	return uniform_int_distribution<int> (l, r)(gen);
}

int n;
array<int, 2> a[N];

ll sum[33][2];

vector < int > solve(int bit, int l, int r) {
	if (bit < 0 || l == r) {
		vector < int > cur(r-l+1);
		for (int i = l; i <= r; ++i) {
			cur[i-l] = a[i][1];
		}

		return cur;
	}

   	int ptr = l;
   	while(ptr <= r && !(a[ptr][0] & (1<<bit))) {
   		++ptr;
   	}
   	if(ptr == l || ptr > r) {
   		return solve(bit-1, l, r);
   	}
   	vector < int > A = solve(bit-1, l, ptr-1);
   	vector < int > B = solve(bit-1, ptr, r);
   	vector < int > C;
   	{
   		int pB = 0;
   		int nA = sz(A);
		int nB = sz(B);

		ll res = 0;
		for (int x : A) {
			while(nB > pB && B[pB] < x) {
				C.pb(B[pB++]);
			}

			C.pb(x);
			res += pB;
		}
		while(pB < nB) {
			C.pb(B[pB++]);
		}

		sum[bit][0] += res;
		sum[bit][1] += (nB * (ll)nA) - res;
   	}

   	return C;
}

int main () {
	SpeedForce;
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i][0];
		a[i][1] = i;
	}

	sort(a+1, a+n+1);
	solve(29, 1, n);
	int ans = 0;
	ll res = 0;
	for (int bit = 0; bit < 30; ++bit) {
		int b = (sum[bit][1] < sum[bit][0]);
		res += sum[bit][b];
		ans += (b<<bit);
	}

	printf("%lld %d\n", res, ans);

	return Accepted;
}

// B...a