#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {
  int N;
  cin >> N;
  vector<int> a(N);
  for (int i = 0; i < N; i++) cin >> a[i];
  vector<int> b(N);
  for (int i = 0; i < N; i++) {
    if (i == 0) {
      b[i] = a[i];
    } else {
      b[i] = b[i - 1] ^ a[i];
    }
    cout << b[i] << endl;
  }
  if (b[N - 1] == 0) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}
