#include <bits/stdc++.h>
int main(void) {
  int n;
  int a[100000] = {0};
  int bit[100000][30] = {0};
  int max = 0, temp;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    if (max < a[i]) max = a[i];
  }
  for (int i = 0; i < n; i++) {
    temp = a[i];
    for (int j = 0; j <= log2(max); j++) {
      bit[i][j] = temp % 2;
      temp /= 2;
    }
  }
  for (int i = 0; i <= log2(max); i++) {
    temp = 0;
    for (int j = 0; j < n; j++) {
      temp += bit[j][i];
    }
    if (temp % 2) {
      printf("No");
      break;
    } else if (i == floor(log2(max))) {
      printf("Yes");
    }
  }
  return 0;
}
