#include <bits/stdc++.h>
using namespace std;
int XOR(int n, int m) {
  int ans = 0, k = 0;
  while (int(n / (pow(2, k))) != 0 || int(n / (pow(2, k))) != 0) {
    if (int(n / (pow(2, k))) % 2 != int(m / (pow(2, k))) % 2) {
      ans += pow(2, k);
    }
    k++;
  }
  return ans;
}
int main() {
  int N;
  cin >> N;
  int a[N], ans;
  for (int i = 0; i < N; i++) {
    cin >> a[i];
    if (i == 0) {
      ans = a[0];
    } else {
      ans = XOR(ans, a[i]);
    }
  }
  if (ans == 0)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}
