#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
const int MOD = 1e9 + 7;
const ll ZER = 0;
int main() {
  ll n;
  cin >> n;
  vector<ll> a(n);
  ll x = 0;
  bool f = true;
  ll cnt = 0;
  for (int i = 0; (i) < (int)(n); i++) {
    cin >> a[i];
    cnt += a[i];
    x ^= a[i];
  }
  if (x == 0 && cnt < 1e9)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
