#include <bits/stdc++.h>
using namespace std;
const double PI = 2 * acos(0.0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
  return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1>
inline istream &operator>>(istream &in, pair<T0, T1> &a) {
  return in >> a.first >> a.second;
}
template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << ", " << get<3>(a) << "}";
}
template <class T>
inline ostream &operator<<(ostream &out, vector<T> &a) {
  out << "[";
  for (int i = 0; i < int(a.size()); ++i)
    out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
  return out;
}
void smain();
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << setprecision(4) << fixed;
  smain();
  return 0;
}
void smain() {
  int n;
  cin >> n;
  multiset<int> st;
  for (int i = 0; i < int(n); ++i) {
    int kek;
    cin >> kek;
    st.insert(kek);
  }
  set<int> un(st.begin(), st.end());
  if (un.size() > 3) {
    cout << "No\n";
    return;
  }
  vector<int> start(un.begin(), un.end());
  vector<int> a(n);
  do {
    multiset<int> save = st;
    st.erase(st.find(start[0]));
    st.erase(st.find(start[1]));
    a[0] = start[0], a[1] = start[1];
    for (int i = 2; i < n; ++i) {
      a[i] = a[i - 1] ^ a[i - 2];
      if (!st.count(a[i])) {
        break;
      }
      st.erase(st.find(a[i]));
    }
    if (st.empty()) {
      cout << "Yes\n";
      return;
    }
  } while (next_permutation(start.begin(), start.end()));
  cout << "No\n";
}
