#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
void scan(int& a) { scanf("%d", &a); }
void scan(long long& a) { scanf("%lld", &a); }
template <class T>
void scan(T& a) {
  cin >> a;
}
template <class T>
void scan(vector<T>& vec) {
  for (auto&& it : vec) scan(it);
}
void in() {}
template <class Head, class... Tail>
void in(Head& head, Tail&... tail) {
  scan(head);
  in(tail...);
}
void print(const int& a) { printf("%d", a); }
void print(const long long& a) { printf("%lld", a); }
void print(const double& a) { printf("%.15lf", a); }
template <class T>
void print(const T& a) {
  cout << a;
}
template <class T>
void print(const vector<T>& vec) {
  if (vec.empty()) return;
  print(vec[0]);
  for (auto it = vec.begin(); ++it != vec.end();) {
    putchar(' ');
    print(*it);
  }
}
void out() { putchar('\n'); }
template <class T>
void out(const T& t) {
  print(t);
  putchar('\n');
}
template <class Head, class... Tail>
void out(const Head& head, const Tail&... tail) {
  print(head);
  putchar(' ');
  out(tail...);
}
template <class T>
void dprint(const T& a) {
  cerr << a;
}
template <class T>
void dprint(const vector<T>& vec) {
  if (vec.empty()) return;
  cerr << vec[0];
  for (auto it = vec.begin(); ++it != vec.end();) {
    cerr << " " << *it;
  }
}
void debug() { cerr << endl; }
template <class T>
void debug(const T& t) {
  dprint(t);
  cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head& head, const Tail&... tail) {
  dprint(head);
  cerr << " ";
  debug(tail...);
}
int main() {
  int n;
  in(n);
  vector<int> vec(n);
  set<int> kind;
  map<int, int> memo;
  for (int i = 0; i < (int)(n); i++) {
    in(vec[i]);
    if (kind.count(vec[i])) {
      memo[vec[i]]++;
    } else {
      kind.insert(vec[i]);
      memo[vec[i]] = 1;
    }
  }
  if (kind.size() >= 4) {
    out("No");
  } else if (kind.size() == 3) {
    vector<int> vec(3);
    int i = 0;
    for (auto value : kind) {
      vec[i] = value;
      i++;
    }
    bitset<32> abit(vec[0]), bbit(vec[1]), cbit(vec[2]);
    abit = (abit ^ bbit);
    abit = (abit ^ cbit);
    if (abit.to_ullong() == 0 && memo[vec[0]] == memo[vec[1]] &&
        memo[vec[1]] == memo[vec[2]])
      printf("Yes\n");
    else
      printf("No\n");
  } else if (kind.size() == 2) {
    vector<int> vec(2);
    int i = 0;
    for (auto value : kind) {
      vec[i] = value;
      i++;
    }
    sort(vec.begin(), vec.end());
    if (vec[0] == 0 && memo[vec[0]] == 2 * memo[vec[1]])
      printf("Yes\n");
    else
      printf("No\n");
  } else {
    if (*begin(kind) == 0)
      printf("Yes\n");
    else
      printf("No\n");
  }
}
