#include <bits/stdc++.h>
using namespace std;
unordered_map<int, int> Map;
int main() {
  int n;
  cin >> n;
  vector<int> V;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    Map[x]++;
    if (Map[x] == 1) {
      V.push_back(x);
    }
  }
  int s = 0;
  for (int x : V) s ^= x;
  if (s == 0 && V.size() == 3)
    cout << "Yes\n";
  else
    cout << "No\n";
  return 0;
}
