#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main(void) {
	int N, ans;
	cin >> N;

	vector<int> v(N);
	for(int i=0; i<N; i++) {
		cin >> v[i];
	}
	sort(v.begin(), v.end());

	do {
		int sum=0;
		for(int i=0; i<N/2; i++) {
			sum += v[i] ^ v[i+N/2];
		}
		ans = max(sum, ans);
		reverse(v.begin()+ N/2, v.end());
	} while(next_permutation(v.begin(), v.end()));
	cout << ans << endl;
	cout << v[1] << endl;
	return 0;
}