#include <bits/stdc++.h>
using namespace std;
long long dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
long long kaijo[200010];
struct edge {
  long long to, cost;
};
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
bool prime(long long a) {
  if (a == 1) return false;
  for (long long i = 2; i * i <= a; i++) {
    if (a % i == 0) return false;
  }
  return true;
}
bool kosa(double ax, double ay, double bx, double by, double cx, double cy,
          double dx, double dy) {
  double ta = (cx - dx) * (ay - cy) + (cy - dy) * (cx - ax);
  double tb = (cx - dx) * (by - cy) + (cy - dy) * (cx - bx);
  double tc = (ax - bx) * (cy - ay) + (ay - by) * (ax - cx);
  double td = (ax - bx) * (dy - ay) + (ay - by) * (ax - dx);
  return tc * td < 0 && ta * tb < 0;
}
void init_fact(long long n) {
  kaijo[0] = 1;
  for (long long i = 1; i <= n; i++) {
    kaijo[i] = kaijo[i - 1] * i;
    kaijo[i] %= 1000000007;
  }
}
long long modpow(long long a, long long b) {
  if (b == 0) return 1;
  if (b % 2) return modpow(a, b - 1) * a % 1000000007;
  long long memo = modpow(a, b / 2);
  return memo * memo % 1000000007;
}
long long comb(long long a, long long b) {
  return kaijo[a] * modpow(kaijo[a - b], 1000000007 - 2) % 1000000007 *
         modpow(kaijo[b], 1000000007 - 2) % 1000000007;
}
long long g(long long x) {
  x = modpow(x, 1000000007 - 2);
  return x;
}
long long n, a[100010];
long long cnt[31];
signed main() {
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> a[i];
  if (n == 3) {
    for (long long j = 0; j < 3; j++) {
      for (long long i = 0; i < 31; i++) {
        if ((a[j] >> i) & 1) cnt[i]++;
      }
    }
    bool flag = true;
    for (long long i = 0; i < 31; i++) {
      if (cnt[i] % 2 != 0) flag = false;
    }
    if (flag)
      puts("Yes");
    else
      puts("No");
  } else {
    bool flag = true;
    for (long long i = 0; i < n; i++) {
      if (a[i] != 0) flag = false;
    }
    if (flag)
      puts("Yes");
    else
      puts("No");
  }
  return 0;
}
