#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
ll mul_limited(ll A, ll B, ll M = INF) { return B == 0 ? 0 : A > M / B ? M : A * B; }
ll pow_limited(ll A, ll B, ll M = INF) { if (A == 0 || A == 1) {return A;} ll res = 1; for (int i = 0; i < B; i++) {if (res > M / A) return M; res *= A;} return res;}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
//*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
template <class T, internal::is_static_modint_t<T> * = nullptr>
istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }
template <class T, internal::is_dynamic_modint_t<T> * = nullptr>
istream &operator>>(istream &is, T &a) { ll v; is >> v; a = v; return is; }
template <class T, internal::is_static_modint_t<T> * = nullptr>
ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }
template <class T, internal::is_dynamic_modint_t<T> * = nullptr>
ostream &operator<<(ostream &os, const T &a) { os << a.val(); return os; }
//*/
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " "); cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

template<class T = ll>
struct XorBasis : vector<T>
{
  XorBasis() {}
  XorBasis(const vector<T> &A)
  {
    for (T e : A)
      add(e);
  }

  // e を追加
  // O(w)
  bool add(T e)
  {
    for (T b : *this)
      chmin(e, T(e ^ b));
    //* get 系を使う際に必要
    for (T &b : *this)
      chmin(b, T(e ^ b));
    //*/
    if (e != T(0))
    {
      (*this).emplace_back(e);
      //* get 系を使う際に必要
      sort((*this).begin(), (*this).end());
      //*/
      return true;
    }
    return false;
  }
  // e が作れるか判定
  // O(w)
  bool contains(T e) const
  {
    for (T b : (*this))
      chmin(e, T(e ^ b));
    return e == T(0);
  }

  // 作れる中で小さい方から k 番目の値
  // (当然ながら) 個数は 2^size 個
  // O(w)
  T get(T k) const
  {
    assert(0 <= k && k < (T(1) << (*this).size()));
    T res = 0;
    for (int i = 0; i < (int)(*this).size(); i++)
      if (k & (T(1) << i))
        res ^= (*this)[i];
    return res;
  }

  // 作れる中で v 以下で最大のものの (index, value)
  // index == (作れる v 以下のものの個数) - 1
  // index + 1: v 以上で最小のもの
  // O(w)
  pair<T, T> lower_bound(T v) const
  {
    assert(v >= 0);
    T idx = 0, val = 0;
    for (int i = (int)(*this).size() - 1; i >= 0; i--)
      if ((val ^ (*this)[i]) <= v)
        idx ^= T(1) << i, val ^= (*this)[i];
    return make_pair(idx, val);
  }
  // 作れる中で v 未満で最大のものの (index, value)
  // index == (作れる v 未満のものの個数) - 1
  // index + 1: v 超過で最小のもの
  // O(w)
  pair<T, T> upper_bound(T v) const { return lower_bound(v - 1); }
};

int main()
{
  ll N;
  cin >> N;
  vector<ll> A(N);
  for (ll i = 0; i < N; i++)
  {
    cin >> A.at(i);
  }
  ll x = 0;
  for (auto a : A)
  {
    x ^= a;
  }
  if (x != 0)
    FINALANS("No");

  XorBasis basis(A);
  bool ans = N - (ll)basis.size() >= 2;
  cout << (ans ? "Yes" : "No") << endl;
}