#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n;
  cin >> n;
  vector<ll> a(n), cnt(5050);
  ll s = 0;
  bool t = false;
  rep(i, n) {
    cin >> a[i];
    cnt[a[i]]++;
    s ^= a[i];
    t |= cnt[a[i]] >= 2;
  }
  if (s) {
    cout << "No" << '\n';
    return;
  }
  if (t || cnt[0]) {
    cout << "Yes" << '\n';
    return;
  }
  vector<int> dp(10000);
  dp[a[0]] = 1;
  for (int i = 1; i < n - 1; i++) {
    vector<int> p = dp;
    rep(j, 9000) if (p[j]) dp[j ^ a[i]] = true;
  }
  cout << (dp[0] ? "Yes" : "No") << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}