#include <bits/stdc++.h>
using ll = long long;
using namespace std;
string solve(bool a) { return ((a) ? "Yes" : "No"); }
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
  os << "(" << p.first << "," << p.second << ")";
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "{";
  for (int i = 0, i_len = (int)(v.size()); i < i_len; i++) {
    if (i) os << ",";
    os << v[i];
  }
  os << "}";
  return os;
}
template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
  is >> p.first >> p.second;
  return is;
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
  for (int i = 0, i_len = (int)(v.size()); i < i_len; i++) {
    is >> v[i];
  }
  return is;
}
const long long INFLL = 1LL << 60;
const int INF = 1 << 30;
const double PI = acos(-1);
int main() {
  int n;
  bool ans = true;
  cin >> n;
  vector<long long> a(n);
  cin >> a;
  ll cnt = 0LL;
  for (int i = 0, i_len = (int)(n); i < i_len; i++) {
    cnt ^= a[i];
  }
  cout << solve(cnt == 0LL) << endl;
}
