#include <bits/stdc++.h>
using namespace std;
int n;
int a[100003];
bool lt[100003];
int flag;
bool find(int e) {
  for (int i = 1; i <= n; i++) {
    if (!lt[a[i]] && a[i] == e) {
      flag = i;
      return true;
    }
  }
  return false;
}
int main() {
  int ans;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    if (i == 1)
      ans = a[i];
    else
      ans = ans ^ a[i];
  }
  for (int i = 1; i <= n; i++) {
    flag = 0;
    int need = ans ^ a[i];
    if (find(need)) lt[flag] = true;
  }
  int k;
  for (int i = 1; i <= n; i++) {
    if (lt[i]) k++;
  }
  if (k < n) {
    cout << "No" << endl;
    return 0;
  } else {
    cout << "Yes" << endl;
    return 0;
  }
}
