// #define LOCAL #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; template ostream& operator <<(ostream& out, const pair& a) { out << "(" << a.first << "," << a.second << ")"; return out; } template ostream& operator <<(ostream& out, const array& a) { out << "["; bool first = true; for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]"; return out; } template ostream& operator <<(ostream& out, const vector& a) { out << "["; bool first = true; for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]"; return out; } template ostream& operator <<(ostream& out, const set& a) { out << "{"; bool first = true; for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}"; return out; } template ostream& operator <<(ostream& out, const multiset& a) { out << "{"; bool first = true; for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}"; return out; } template ostream& operator <<(ostream& out, const map& a) { out << "{"; bool first = true; for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}"; return out; } #ifdef LOCAL #define trace(...) __f(#__VA_ARGS__, __VA_ARGS__) #else #define trace(...) 42 #endif template void __f(const char* name, Arg1&& arg1){ cerr << name << ": " << arg1 << endl; } template void __f(const char* names, Arg1&& arg1, Args&&... args){ const char* comma = strchr(names + 1, ','); cerr.write(names, comma - names) << ": " << arg1 << " |"; __f(comma + 1, args...); } template auto vect(const T& v, int n) { return vector(n, v); } template auto vect(const T& v, int n, D... m) { return vector(n, vect(v, m...)); } using int64 = long long; using int128 = __int128_t; using ii = pair; #define SZ(x) (int)((x).size()) template static constexpr T inf = numeric_limits::max() / 2; const int MOD = 1e9 + 7; // const int MOD = 998244353; mt19937_64 mrand(random_device{}()); int64 rnd(int64 x) { return mrand() % x; } constexpr inline int lg2(int64 x) { return x == 0 ? -1 : sizeof(int64) * 8 - 1 - __builtin_clzll(x); } constexpr inline int64 p2ceil(int64 x) { return 1LL << (lg2(x - 1) + 1); } template void out(const vector& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; } template bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } template void dedup(vector& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); } inline void add_mod(int& x, int y) { x += y; if (x >= MOD) x -= MOD; } inline void sub_mod(int& x, int y) { x += MOD - y; if (x >= MOD) x -= MOD; } inline int mod(int x) { return x >= MOD ? x - MOD : x; } struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); }; } fast_ios_; template int find_first(const bitset& x) { #ifdef LOCAL int k; for (k = 0; k < N && !x[k]; ++k); return k; #else return x._Find_first(); #endif } const int K = 13; void add(vector>& a, bitset x) { for (int i = 0; i < a.size(); ++i) { auto& v = a[i]; int kx = find_first(x); int kv = find_first(v); if (kx <= kv) { if (v[kx]) { x ^= v; } else { v ^= x; x ^= v; } } } if (x != 0) a.push_back(x); } bool contain(const vector>& a, bitset x) { int i, j; for (i = 0; i < K && !x[i]; ++i); for (auto& v : a) { for (j = 0; j < K && !v[j]; ++j); if (j < i) continue; if (j > i) return false; x = x ^ v; for (; i < K && !x[i]; ++i); if (i == K) break; } return i == K; } int main() { int n; cin >> n; vector> a; int sum = 0; for (int i = 0; i < n; ++i) { int x; cin >> x; sum ^= x; add(a, x); } cout << (sum == 0 && SZ(a) < n - 1 ? "Yes" : "No") << '\n'; return 0; }