#include <bits/stdc++.h>
using namespace std;
void canhazfast() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
}
template <typename T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T>
T extgcd(T a, T b, T &x, T &y) {
  T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
  while (b) {
    T q = a / b;
    a %= b;
    swap(a, b);
    x0 -= q * x1;
    swap(x0, x1);
    y0 -= q * y1;
    swap(y0, y1);
  }
  x = x0;
  y = y0;
  return a;
}
int ctz(unsigned x) { return __builtin_ctz(x); }
int ctzll(unsigned long long x) { return __builtin_ctzll(x); }
int clz(unsigned x) { return __builtin_clz(x); }
int clzll(unsigned long long x) { return __builtin_clzll(x); }
int popcnt(unsigned x) { return __builtin_popcount(x); }
int popcntll(unsigned long long x) { return __builtin_popcountll(x); }
int bsr(unsigned x) { return 31 ^ clz(x); }
int bsrll(unsigned long long x) { return 63 ^ clzll(x); }
int main() {
  canhazfast();
  int n, x = 0;
  map<int, int> mp;
  vector<int> vs, fs;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    int a;
    cin >> a;
    ++mp[a];
  }
  if (n % 3) return cout << "No\n", 0;
  for (auto &p : mp) {
    x ^= p.first;
    vs.push_back(p.first);
    fs.push_back(p.second);
  }
  if (mp.size() == 3) {
    if (x) return cout << "No\n", 0;
    sort((fs).begin(), (fs).end());
    if (fs[0] != fs[2]) return cout << "No\n", 0;
    return cout << "Yes\n", 0;
  }
  if (mp.size() == 2) {
    if (vs[0] != 0 || fs[0] != n / 3) return cout << "No\n", 0;
    return cout << "Yes\n", 0;
  }
  if (mp.size() == 1 && vs[0] == 0) return cout << "Yes\n", 0;
  cout << "No\n";
  return 0;
}
