#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <algorithm>
#include <numeric>
#include <fstream>
#include <iomanip>

typedef long double ld;
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;


namespace util {

// 文字列のSplit
std::vector< std::string > split(std::string s, char delimiter)
{
  std::vector< std::string > vs;
  std::string sub;
  for (auto c : s) {
    if (c == delimiter) vs.push_back(sub), sub.clear();
    else sub += c;
  }
  vs.push_back(sub);
  return vs;
}

// 累乗
ll pow(ll x, ll n)
{
  ll ret = 1LL;
  while (n > 0) ret *= x, n--;
  return ret;
}

// 桁和
ll digitSum(ll x)
{
  std::string s = std::to_string(x); ll ret = 0LL;
  for (auto c : s) {ret += c - '0';}
  return ret;
}

} // namespace util

// Minimum, Maximum
template<class T> T minimum(T head, T tail) { return std::min(head, tail); }
template<class H, class... T> H minimum(H head, T... tail) { return std::min(head, minimum(tail...)); }
template<class T> T maximum(T head, T tail) { return std::max(head, tail); }
template<class H, class... T> H maximum(H head, T... tail) { return std::max(head, maximum(tail...)); }

// Output
template<class T, class S> std::ostream& operator <<(std::ostream& os, std::pair<T, S> p)
{
  return os << "(" << p.first << " " << p.second << ")";
}

template<class T> std::ostream& operator <<(std::ostream& os, std::vector< T > v)
{
  for (ll i = 0; i < (ll)v.size(); i++){ os << " [" << i << "]" << v[i]; if (i % 10 == 9) os << std::endl; }
  //os << v[0]; for (ll i = 1; i < (ll)v.size(); i++){ os << " " << v[i]; }
  return os;
}

template<class T, class S> std::ostream& operator <<(std::ostream& os, std::map< T, S > m)
{
  ll i = 0; for (auto p : m){ os << " [" << i << "]" << p.first << "->" << p.second; i++;}
  return os;
}

template<class T> std::ostream& operator <<(std::ostream& os, std::vector< std::vector<T> > vv)
{
  for (auto& vec : vv){ os << vec << std::endl; }
  os << "--------" << std::endl;
  return os;
}

void print(){ std::cout << std::endl; }
template<typename H> void print(H&& head){ std::cout << head << std::endl; }
template<typename H, typename... T> void print(H&& head, T&&... tail){
  std::cout << head << " ", print(std::forward<T>(tail)...);
}

// GCD, LCM
ll gcd(ll a, ll b) {
  while (b != 0) { a %= b; std::swap(a, b); }
  return a;
}
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }

// DIGNUM
std::vector<ll> dignum(ll x) {
  if (x == 0) return {0};
  std::vector<ll> res;
  while (x) {
    res.push_back(x % 10);
    x /= 10;
  }
  std::reverse(res.begin(), res.end());
  return res;
}

// FAIL
void fail(){ print(-1); std::exit(0); }
//void fail(){ print("No"); std::exit(0); }

int main()
{
  std::cin.tie(nullptr);
  std::cout.tie(nullptr);
  std::ios::sync_with_stdio(false);

  ll N;
  std::cin >> N;
  std::map< ll, ll > mp;
  for (ll i = 0; i < N; i++) {
    ll a; std::cin >> a;
    mp[a]++;
  }

  // x, z, y と並んでいるとすると
  // z = x ^ y である
  // そのため、x ^ z = x ^ (x ^ y) = y になる
  // x, z, y と並んだら、その次の値は z ^ y = (x ^ y) ^ y = x になる
  // また、x ^ z ^ y = x ^ (x ^ y) ^ z = 0 となる
  bool judge = true;
  if (N % 3 == 0) {
    if (mp.size() > 3) {
      judge = false;
    }
    if (mp.size() == 3) {
      ll num = 0LL;
      for (auto p : mp) num ^= p.first;
      if (num != 0LL) judge = false;
      for (auto p : mp) { if (p.second != N / 3) judge = false; }
    }
    if (mp.size() == 2) {
      for (auto p : mp) {
        if (!((p.first == 0 && p.second == N / 3) || p.second == 2 * N / 3)) judge = false;
      }
    }
    if (mp.size() == 1) {
      if (mp[0] != N) judge = false;
    }
  } else {
    if (!(mp.size() == 1 && mp[0] == N)) judge = false;
  }

  print(judge ? "Yes" : "No");
  return 0;
}


Measured memory_bytes: 5120