#include <bits/stdc++.h>
using namespace std;
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
vector<long long> G[500005];
priority_queue<long long> pql;
priority_queue<pair<long long, long long> > pqp;
priority_queue<long long, vector<long long>, greater<long long> > pqls;
priority_queue<pair<long long, long long>, vector<pair<long long, long long> >,
               greater<pair<long long, long long> > >
    pqps;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
long long mod = 1000000007;
long long rui(long long number1, long long number2) {
  if (number2 == 0) {
    return 1;
  } else {
    long long number3 = rui(number1, number2 / 2);
    number3 *= number3;
    number3 %= mod;
    if (number2 % 2 == 1) {
      number3 *= number1;
      number3 %= mod;
    }
    return number3;
  }
}
long long gcd(long long number1, long long number2) {
  if (number1 > number2) {
    swap(number1, number2);
  }
  if (number1 == 0 || number1 == number2) {
    return number2;
  } else {
    return gcd(number2 % number1, number1);
  }
}
void YES(bool condition) {
  if (condition) {
    cout << "YES" << endl;
    ;
  } else {
    cout << "NO" << endl;
    ;
  }
  return;
}
void Yes(bool condition) {
  if (condition) {
    cout << "Yes" << endl;
    ;
  } else {
    cout << "No" << endl;
    ;
  }
  return;
}
long long n, m, num, sum, ans, a, b, c, d, e, g, h, w, i, j, k, q;
long long x[500005], y[500005], z[500005];
char s[500005], t[500005];
int main() {
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> x[i];
  }
  sort(x, x + n);
  for (i = 0; i < n - 1; i++) {
    if (x[i] != x[i + 1]) a++;
  }
  a += 1;
  if (a == 1) {
    Yes(x[0] == 0);
  } else if (a == 2) {
    Yes(x[0] == 0 && x[n / 3] != 0 && n % 3 == 0);
  } else if (a == 3) {
    Yes(n % 3 == 0 && x[n / 3] != x[n / 3 - 1] &&
        x[n / 3 * 2] != x[n / 3 * 2 - 1] && (x[0] ^ x[n / 3]) == x[n / 3 * 2]);
  } else {
    Yes(0);
  }
  return 0;
}
