#include <bits/stdc++.h>
using namespace std;
template <class X>
void pr(X test) {
  cout << test << endl;
}
template <class X>
void prr(X test) {
  for (auto it : test) {
    cout << it << endl;
  }
}
template <class X>
void prrr(X test) {
  int f = 0;
  for (auto it : test) {
    cout << (f++ != 0 ? " " : "") << it;
  }
  cout << endl;
}
template <typename X>
istream &operator>>(istream &i, vector<X> &v) {
  for (X &x : v) i >> x;
  return i;
}
class UF {
 public:
  int *id;
  int cnt;
  int *sz;
  UF(int N) {
    cnt = N;
    id = new int[N];
    sz = new int[N];
    for (int i = 0; i < N; i++) {
      id[i] = i;
      sz[i] = 1;
    }
  }
  ~UF() {
    delete[] id;
    delete[] sz;
  }
  int find(int p) {
    int root = p;
    while (root != id[root]) root = id[root];
    while (p != root) {
      int newp = id[p];
      id[p] = root;
      p = newp;
    }
    return root;
  }
  void merge(int x, int y) {
    int i = find(x);
    int j = find(y);
    if (i == j) return;
    if (sz[i] < sz[j]) {
      id[i] = j;
      sz[j] += sz[i];
    } else {
      id[j] = i;
      sz[i] += sz[j];
    }
    cnt--;
  }
  bool connected(int x, int y) { return find(x) == find(y); }
  int count() { return cnt; }
};
vector<long long> divv(long long n) {
  vector<long long> v;
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      v.push_back(i);
      if (i * i != n) v.push_back(n / i);
    }
  }
  sort(v.begin(), v.end());
  return v;
}
int main() {
  long long n;
  cin >> n;
  vector<long long> v(n);
  cin >> v;
  unordered_map<long long, long long> m;
  long long nc = 0;
  for (long long i = 0; i < n; i++) {
    m[v[i]] += 1;
    if (v[i] != 0) nc = 1;
  }
  if (nc == 0) {
    pr("yes");
    return 0;
  }
  long long siz = m.size();
  if (n % 3 != 0) {
    pr("No");
  } else if (siz > 3) {
    pr("No");
  } else {
    long long cout = n / 3;
    vector<long long> ans;
    for (auto it : m) {
      if (it.second % cout != 0) {
        pr("No");
        return 0;
      } else if (it.second / cout == 1) {
        ans.push_back(it.first);
      } else if (it.second / cout == 2) {
        ans.push_back(it.first);
        ans.push_back(it.first);
      } else if (it.second / cout == 3) {
        ans.push_back(it.first);
        ans.push_back(it.first);
        ans.push_back(it.first);
      } else {
        pr("No");
        return 0;
      }
    }
    bool b = false;
    if ((ans[0] ^ ans[1]) == ans[2]) b = true;
    if ((ans[0] ^ ans[2]) == ans[1]) b = true;
    if ((ans[1] ^ ans[2]) == ans[0]) b = true;
    if (b)
      pr("Yes");
    else
      pr("No");
  }
  return 0;
}
