#include <bits/stdc++.h>
using namespace std;
int main() {
  int N;
  cin >> N;
  vector<int> a(N);
  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }
  int max = 0;
  for (int i = 0; i < N; i++) {
    if (a[i] > max) max = a[i];
  }
  long long int dig = log(max) / log(2);
  vector<int> dig_count(dig + 2, 0);
  for (int i = 0; i < N; i++) {
    for (int j = 0; j <= dig; j++) {
      if (a[i] & (1 << j)) {
        dig_count[j]++;
      }
    }
  }
  bool flag = true;
  for (int i = 0; i <= dig; i++) {
    if (dig_count[i] % 2 != 0) flag = false;
  }
  if (flag)
    cout << "Yes";
  else
    cout << "No";
}
