#include <bits/stdc++.h>
#define int long long
using namespace std;
int m, ans, cnt, p[35];
void insert(int x)
{
	for (int i = 32; ~i; i--)
		if (x & (1ll << i))
			if (!p[i])
			{
				p[i] = x;
				return;
			}
			else
				x ^= p[i];
}
void rebuild()
{
	for (int i = 32; ~i; i--)
		for (int j = i - 1; ~j; j--)
			if (p[i] & (1ll << j))
				p[i] ^= p[j];
	for (int i = 0; i <= 32; i++)
		if (p[i])
			p[cnt] = p[i], cnt++;
}
void dfs(int res, int now)
{
	if (res == cnt - 2)
	{
		ans += (now ^ p[res] ^ p[res + 1]) + (now ^ p[res + 1]) + (now ^ p[res]) + now;
		return;
	}
	dfs(res + 1, now);
	dfs(res + 1, now ^ p[res]);
}
void dfs1(int res, int now)
{
	if (res == cnt)
	{
		ans += now;
		return;
	}
	dfs1(res + 1, now);
	dfs1(res + 1, now ^ p[res]);
}
signed main()
{
#ifndef ONLINE_JUDGE
	freopen("data/data.in", "r", stdin);
// freopen("data/data.out", "w", stdout);
#endif
	std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	cin >> m;
	while (m--)
	{
		int now;
		cin >> now;
		insert(now);
	}
	rebuild();
	if (cnt > 20)
		dfs(0, 0);
	else
		dfs1(0, 0);
	cout << ans;
	exit(0);
}