线性基模板题

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAXN = 64;
LL num[MAXN], n;
int insert(LL x) {
    for (int i = 63; i >= 0; i--) {
        if ((x >> i) & 1) {
            if (!num[i]) {
                num[i] = x;
                return 1;
            }
            x ^= num[i];
        }
    }
    return 0;
}
LL query() {
    LL ans = 0;
    for (int i = 63; i >= 0; i--) {
        if ((ans ^ num[i]) > ans) {
            ans ^= num[i];
        }
    }
    return ans;
}
int main() {
    LL x;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> x, insert(x);
    cout << query() << endl;
    return 0;
}