#include <bits/stdc++.h>
const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;
using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
bool paircomp(const pair<ll, ll> &a, const pair<ll, ll> &b) {
  if (a.first == b.first) return a.second < b.second;
  return a.first < b.first;
}
ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vl A(N, 0);
  bool all0 = true;
  vl B(31, 0);
  map<ll, ll> M;
  for (ll i = 0; i < (N); i++) {
    cin >> A[i];
    if (A[i] != 0) all0 = false;
    if (M.find(A[i]) == M.end())
      M[A[i]] = 1;
    else
      M[A[i]] = M[A[i]] + 1;
  }
  if (all0) {
    cout << "Yes" << endl;
    return 0;
  }
  if (N % 3 == 0 && M.size() == 3) {
    vl a(3, 0);
    bool ok = true;
    ll i = 0;
    for (auto &m : M) {
      if (m.second != N / 3) ok = false;
      a[i] = m.first;
      i++;
    }
    if ((ok && a[0] ^ a[1]) == a[2]) {
      cout << "Yes" << endl;
      return 0;
    }
  }
  cout << "No" << endl;
  return 0;
}
