// author: hotman78 // date: 2023/10/22-16:39:22 // --- begin raw code ----------------- // #include"cpplib/util/template.hpp" // // int main(){ // lint n; // cin>>n; // vec a(n); // rep(i,n)cin>>a[i]; // reverse(all(a)); // auto dp=make_vector(0,n+1); // vec b(n+1); // rep(i,n)b[i+1]=b[i]^a[i]; // rep(i,n+1){ // sets; // rep(j,i){ // // cerr<<(dp[j]^b[i]^b[j])< using namespace std; #line 1 "cpplib/util/ioutil.hpp" // template // std::ostream& output(std::ostream& out,const Head& head,const Args&... args){ // out>>head; // return output(head,args...); // } // template // std::ostream& output(std::ostream& out,const Head& head){ // out>>head; // return out; // } template std::ostream &operator<<(std::ostream &out, std::pair v) { out << "(" << v.first << "," << v.second << ")"; return out; } // template // ostream& operator<<(ostream& out,std::tuplev){ // std::apply(output,v); // return out; // } #line 11 "cpplib/util/template.hpp" struct __INIT__ { __INIT__() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } __INIT__; typedef long long lint; constexpr long long INF = 1LL << 60; constexpr int IINF = 1 << 30; constexpr double EPS = 1e-10; #ifndef REACTIVE #define endl '\n'; #endif typedef vector vec; typedef vector> mat; typedef vector>> mat3; typedef vector svec; typedef vector> smat; template using V = vector; template using VV = V>; #define output(t) \ { \ bool f = 0; \ for (auto val : (t)) { \ cout << (f ? " " : "") << val; \ f = 1; \ } \ cout << endl; \ } #define output2(t) \ { \ for (auto i : t) \ output(i); \ } #define debug(t) \ { \ bool f = 0; \ for (auto i : t) { \ cerr << (f ? " " : "") << i; \ f = 1; \ } \ cerr << endl; \ } #define debug2(t) \ { \ for (auto i : t) \ debug(i); \ } #define loop(n) for (long long _ = 0; _ < (long long)(n); ++_) #define _overload4(_1, _2, _3, _4, name, ...) name #define __rep(i, a) repi(i, 0, a, 1) #define _rep(i, a, b) repi(i, a, b, 1) #define repi(i, a, b, c) \ for (long long i = (long long)(a); i < (long long)(b); i += c) #define rep(...) _overload4(__VA_ARGS__, repi, _rep, __rep)(__VA_ARGS__) #define _overload3_rev(_1, _2, _3, name, ...) name #define _rep_rev(i, a) repi_rev(i, 0, a) #define repi_rev(i, a, b) \ for (long long i = (long long)(b)-1; i >= (long long)(a); --i) #define rrep(...) _overload3_rev(__VA_ARGS__, repi_rev, _rep_rev)(__VA_ARGS__) #define all(n) begin(n), end(n) template bool chmin(T &s, const E &t) { bool res = s > t; s = min(s, t); return res; } template bool chmax(T &s, const E &t) { bool res = s < t; s = max(s, t); return res; } const vector dx = {1, 0, -1, 0, 1, 1, -1, -1}; const vector dy = {0, 1, 0, -1, 1, -1, 1, -1}; #define SUM(v) accumulate(all(v), 0LL) #if __cplusplus >= 201703L template auto make_vector(T x, int arg, Args... args) { if constexpr (sizeof...(args) == 0) return vector(arg, x); else return vector(arg, make_vector(x, args...)); } #endif #define extrep(v, ...) for (auto v : __MAKE_MAT__({__VA_ARGS__})) #define bit(n, a) ((n >> a) & 1) vector> __MAKE_MAT__(vector v) { if (v.empty()) return vector>(1, vector()); long long n = v.back(); v.pop_back(); vector> ret; vector> tmp = __MAKE_MAT__(v); for (auto e : tmp) for (long long i = 0; i < n; ++i) { ret.push_back(e); ret.back().push_back(i); } return ret; } using graph = vector>; template using graph_w = vector>>; #if __cplusplus >= 201703L constexpr inline long long powll(long long a, long long b) { long long res = 1; while (b--) res *= a; return res; } #endif template pair &operator+=(pair &s, const pair &t) { s.first += t.first; s.second += t.second; return s; } template pair &operator-=(pair &s, const pair &t) { s.first -= t.first; s.second -= t.second; return s; } template pair operator+(const pair &s, const pair &t) { auto res = s; return res += t; } template pair operator-(const pair &s, const pair &t) { auto res = s; return res -= t; } #define BEGIN_STACK_EXTEND(size) \ void *stack_extend_memory_ = malloc(size); \ void *stack_extend_origin_memory_; \ char *stack_extend_dummy_memory_ = (char *)alloca( \ (1 + (int)(((long long)stack_extend_memory_) & 127)) * 16); \ *stack_extend_dummy_memory_ = 0; \ asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp" \ : "=b"(stack_extend_origin_memory_) \ : "a"((char *)stack_extend_memory_ + (size)-1024)); #define END_STACK_EXTEND \ asm volatile("mov %%rax, %%rsp" ::"a"(stack_extend_origin_memory_)); \ free(stack_extend_memory_); int floor_pow(int n) { return n ? 31 - __builtin_clz(n) : 0; } #line 2 "main.cpp" int main() { lint n; cin >> n; vec a(n); rep(i, n) cin >> a[i]; reverse(all(a)); auto dp = make_vector(0, n + 1); vec b(n + 1); rep(i, n) b[i + 1] = b[i] ^ a[i]; rep(i, n + 1) { set s; rep(j, i) { // cerr<<(dp[j]^b[i]^b[j])<