#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const long long MOD = 1000000007ll;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= MOD;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % MOD;
    a = a * a % MOD;
  }
  return res;
}
template <typename t1, typename t2>
inline bool upmax(t1 &a, t2 b) {
  if (a < (t1)b) {
    a = (t1)b;
    return true;
  } else
    return false;
}
template <typename t1, typename t2>
inline bool upmin(t1 &a, t2 b) {
  if (a > (t1)b) {
    a = (t1)b;
    return true;
  } else
    return false;
}
template <typename T>
inline T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T>
inline T lcm(T a, T b) {
  return a * (b / gcd(a, b));
}
template <typename T>
inline T sqr(T a) {
  return a * a;
}
int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
int dkx[] = {-1, -1, 1, 1, -2, -2, 2, 2};
int dky[] = {-2, 2, -2, 2, -1, 1, -1, 1};
const int INF = 1000000404;
const long long LINF = 1e18 * (1ll);
const long double PI = 3.14159265358979323846;
const long double EPS = 1e-9;
const int SQ = 318;
int timer = 0;
int a[100100];
void solve() {
  int n;
  cin >> n;
  map<int, int> cnt;
  for (int(i) = (0); (i) < (n); (i)++) {
    cin >> a[i];
    cnt[a[i]]++;
  }
  sort(a, a + n);
  if (a[n - 1] == 0) {
    cout << "Yes";
    return;
  }
  int A = a[0];
  int B = a[n / 2];
  int C = a[n - 1];
  if (n % 3 == 0 && (int((cnt.size()))) == 2) {
    if (A == 0 && cnt[A] == n / 3 && cnt[B] == n / 2) {
      cout << "Yes" << endl;
      return;
    }
  }
  if (n % 3 == 0 && (int((cnt.size()))) == 3) {
    if (cnt[A] == cnt[B] && cnt[B] == cnt[C] && cnt[A] == n / 3) {
      if ((A ^ B) == C || (A ^ C) == B) {
        cout << "Yes" << endl;
        return;
      }
    }
  }
  cout << "No";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  for (int i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
