P3812 【模板】线性基

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<stack>
#include<vector>
#include<queue>
#include<set>
#include<bitset>
#include<map>
//#include<regex>
#include<cstdio>
#include <iomanip>
#pragma GCC optimize(2)
#define up(i,a,b)  for(int i=a;i<b;i++)
#define dw(i,a,b)  for(int i=a;i>b;i--)
#define upd(i,a,b) for(int i=a;i<=b;i++)
#define dwd(i,a,b) for(int i=a;i>=b;i--)
//#define local
typedef long long ll;
typedef unsigned long long ull;
const double esp = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int inf = 1e9;
using namespace std;
ll read()
{
	char ch = getchar(); ll x = 0, f = 1;
	while (ch<'0' || ch>'9') { if (ch == '-')f = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
	return x * f;
}
typedef pair<int, int> pir;
#define lson l,mid,root<<1
#define rson mid+1,r,root<<1|1
#define lrt root<<1
#define rrt root<<1|1
const int N = 100;
ll b[N];
int n;
int cnt = 0;
void insert(ll x)
{
	dwd(i, 60, 0)
	{
		if (x&(1ll << i))
		{
			if (b[i])
			{
				x ^= b[i];
			}
			else {
				cnt++;
				b[i] = x;
				upd(j, 0, i - 1)if (x >> j & 1)b[i] ^= b[j];
				upd(j, i + 1, 60)if (b[j] >> i & 1)b[j] ^= b[i];
				break;
			}
		}
	}
}
void query()
{
	ll ans = 0;
	dwd(i, 60, 0)
	{
		ans ^= b[i];
	}
	cout << ans << endl;
	return;
}
int main()
{
	n = read();
	upd(i, 1, n)
	{
		ll u; u = read();
		insert(u);
	}
	query();
	return 0;
}