#include using namespace std; #define int long long #define INF 1e9 #define LINF 1e18 const int MOD = 1e9 + 7; const int dy[]={0, 0, 1, -1}; const int dx[]={1, -1, 0, 0}; typedef pair P; typedef pair Pi; typedef pair PP; template void chmin(T& a, const T& b) { a = min(a, b); } template void chmax(T& a, const T& b) { a = max(a, b); } int N, A[14]; int dp[1 << 14]; signed main() { cin.tie(0); ios::sync_with_stdio(false); cin >> N; for(int i = 0; i < N; ++i) cin >> A[i]; for(int i = 0; i < (1 << N); ++i) { for(int j = 0; j < N; ++j) for(int k = 0; k < N; ++k) { if(j == k) continue; if(!(i & (1 << j)) && !(i & (1 << k))) { chmax(dp[i | (1 << j) | (1 << k)], dp[i] + (A[j] ^ A[k])); } } } cout << dp[(1 << N) - 1] << endl; return 0; }