#include <bits/stdc++.h>
using namespace std;
struct InitAim {
  InitAim() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(12);
    cout << fixed;
  }
} aim_cpo;
template <typename T>
bool chmin(T &a, T b) {
  return a > b ? (a = b, true) : false;
}
template <typename T>
bool chmax(T &a, T b) {
  return a < b ? (a = b, true) : false;
}
template <typename T>
void ln(T i, T n) {
  cout << (i == n - 1 ? "\n" : " ");
}
template <typename T, typename S>
ostream &operator<<(ostream &out, const pair<T, S> &pair1) {
  out << '(' << pair1.first << ", " << pair1.second << ')';
  return out;
}
template <typename T>
ostream &operator<<(ostream &out, const vector<T> &vector1) {
  out << '[';
  for (unsigned int i = 0; i < vector1.size(); i++) {
    out << vector1[i];
    if (i == vector1.size() - 1)
      out << "]";
    else
      out << ", ";
  }
  return out;
}
template <typename T>
T LCM(T a, T b) {
  return a / __gcd(a, b) * b;
}
template <typename T>
T EXTGCD(T a, T b, T &x, T &y) {
  T d = a;
  if (b != 0) {
    d = EXTGCD(b, a % b, y, x);
    y -= (a / b) * x;
  } else
    x = 1, y = 0;
  return d;
}
template <typename T>
bool is_prime(T a) {
  for (int i = 2; i * i <= a; i++)
    if (a % i == 0) return true;
  return false;
}
template <typename T, typename S>
T Pow(T a, S b) {
  T res = 1, now = a;
  while (b) {
    if (b & 1) res *= now;
    b >>= 1;
    now *= now;
  }
  return res;
}
long long MOD = 1000000000L + 7L;
template <typename T, typename S>
T ModPow(T a, S b) {
  assert(b >= 0);
  T res = 1, now = (((a) % MOD) + MOD - ((0) % MOD)) % MOD;
  while (b) {
    if (b & 1) res = (((res) % MOD) * ((now) % MOD)) % MOD;
    b >>= 1;
    now = (((now) % MOD) * ((now) % MOD)) % MOD;
  }
  return res;
}
template <typename T>
T ModInverse(T a, T mod, bool prime) {
  if (prime)
    return ModPow(a, mod - 2);
  else {
    T x, y;
    EXTGCD(a, mod, x, y);
    return (mod + x % mod) % mod;
  }
}
template <typename T>
T EulerTotient(T a) {
  vector<pair<int, int>> v;
  for (T i = 2; i * i <= a; i++) {
    int cnt = 0;
    while (a % i == 0) {
      cnt++;
      a /= i;
    }
    if (cnt != 0) v.emplace_back(i, cnt);
  }
  if (a != 1) v.emplace_back(a, 1);
  T res = 1;
  for (int i = 0; i < (int)v.size(); i++) {
    if (v[i].second == 1) {
      res = (((res) % MOD) * ((v[i].first - 1) % MOD)) % MOD;
    } else {
      res =
          (((res) % MOD) * (((((ModPow(v[i].first, v[i].second)) % MOD) + MOD -
                              ((ModPow(v[i].first, v[i].second - 1)) % MOD)) %
                             MOD) %
                            MOD)) %
          MOD;
    }
  }
  return res;
}
long long comb(long long a, long long b) {
  chmin(b, a - b);
  long long res = 1LL, now = a;
  for (long long i = 1; i <= b; i++) {
    res = (((res) % MOD) * ((now) % MOD)) % MOD;
    res = (((((res) % MOD)) % MOD) * (((ModInverse((i), MOD, true))) % MOD)) %
          MOD % MOD;
    now--;
  }
  return res;
}
template <typename T>
class BIT {
 public:
  BIT(int size) { BITTable.assign(++size, 0); }
  T sum(int k) {
    T res = 0;
    for (++k; k > 0; k -= k & -k) {
      res += BITTable[k];
    }
    return res;
  }
  T sum(int l, int r) {
    if (l == 0) return sum(r);
    return sum(r) - sum(l - 1);
  }
  void update(int k, T x) {
    for (++k; k < (int)BITTable.size(); k += k & -k) BITTable[k] += x;
  }

 private:
  vector<T> BITTable;
};
template <typename T>
class IntervalTree {
  using F = function<T(T, T)>;

 public:
  IntervalTree(int n, const F func, const T init) : func(func), init(init) {
    size = 1;
    while ((int)size < n) size <<= 1;
    table.assign(2 * size, init);
  }
  void set(int k, T &x) { table[size + k] = x; }
  void build() {
    for (int i = size - 1; i >= 0; --i) {
      table[i] = func(table[i * 2], table[i * 2 + 1]);
    }
  }
  void update(int k, const T &x) {
    k += size;
    table[k] = x;
    while (k >>= 1) {
      table[k] = func(table[k * 2], table[k * 2 + 1]);
    }
  }
  T query(int a, int b) {
    T L = init, R = init;
    for (a += size, b += size; a < b; a >>= 1, b >>= 1) {
      if (a & 1) L = func(L, table[a++]);
      if (b & 1) R = func(table[--b], R);
    }
    return func(L, R);
  }
  T operator[](const int k) const { return table[k + size]; }

 private:
  unsigned int size;
  vector<T> table;
  const F func;
  const T init;
};
class UnionFind {
 public:
  explicit UnionFind(int _n) : n(_n) {
    par.resize(static_cast<unsigned long>(_n));
    rank.resize(static_cast<unsigned long>(_n));
    sizes.resize(static_cast<unsigned long>(_n));
    for (int i = 0; i < _n; i++) {
      par[i] = i;
      rank[i] = 0;
      sizes[i] = 1;
    }
  }
  int find(int a) {
    if (par[a] == a) return a;
    return par[a] = find(par[a]);
  }
  bool same(int a, int b) { return find(a) == find(b); }
  void unite(int a, int b) { link(find(a), find(b)); }
  int size(int a) { return sizes[find(a)]; }
  void view() {
    for (int i = 0; i < n; i++) {
      cout << " par"
           << "[" << i << "]=" << par[i] << ((i == n - 1) ? "\n" : ",");
    }
    for (int i = 0; i < n; i++) {
      cout << "size"
           << "[" << i << "]=" << sizes[i] << ((i == n - 1) ? "\n" : ",");
    }
    cout << "\n";
  }

 private:
  void link(int a, int b) {
    if (same(a, b)) return;
    if (rank[a] > rank[b]) {
      par[b] = a;
      sizes[a] += sizes[b];
      sizes[b] = 0;
    } else {
      par[a] = b;
      if (rank[a] == rank[b]) rank[b]++;
      sizes[b] += sizes[a];
      sizes[a] = 0;
    }
  }
  int n;
  vector<int> par;
  vector<int> rank;
  vector<int> sizes;
};
template <typename T>
class Dinic {
 public:
  Dinic(int SIZE) : SIZE(SIZE) {
    v = vector<vector<tuple<int, T, int>>>(SIZE + 10);
  }
  void AddEdge(int from, int to, T cap) {
    v[from].push_back(make_tuple(to, cap, v[to].size()));
    v[to].push_back(make_tuple(from, 0, v[from].size() - 1));
  }
  void bfs(int s) {
    level = vector<int>(SIZE + 10, -1);
    queue<int> q;
    level[s] = 0;
    q.push(s);
    while (!q.empty()) {
      int now = q.front();
      q.pop();
      for (int i = 0; i < (int)v[now].size(); i++) {
        int next, nextrv;
        T nextc;
        tie(next, nextc, nextrv) = v[now][i];
        if (nextc > 0 && level[next] < 0) {
          level[next] = level[now] + 1;
          q.push(next);
        }
      }
    }
  }
  T dfs(int now, int t, T f) {
    if (now == t) return f;
    for (int &i = iter[now]; i < (int)v[now].size(); i++) {
      int next, nextrv;
      T nextc;
      tie(next, nextc, nextrv) = v[now][i];
      if (nextc > 0 && level[now] < level[next]) {
        T d = dfs(next, t, min(f, nextc));
        if (d > 0) {
          get<1>(v[now][i]) -= d;
          get<1>(v[next][nextrv]) += d;
          return d;
        }
      }
    }
    return 0;
  }
  T max_flow(int s, int t) {
    T flow = 0;
    for (;;) {
      bfs(s);
      if (level[t] < 0) return flow;
      iter = vector<int>(SIZE + 10, 0);
      int f;
      while ((f = dfs(s, t, INT_MAX)) > 0) {
        flow += f;
      }
    }
  }

 private:
  int SIZE;
  vector<vector<tuple<int, T, int>>> v;
  vector<int> level, iter;
};
template <typename flow_t, typename cost_t>
struct PrimalDual {
  const cost_t INF;
  struct edge {
    int to;
    flow_t cap;
    cost_t cost;
    int rev;
    bool isrev;
  };
  vector<vector<edge>> graph;
  vector<cost_t> potential, min_cost;
  vector<int> prevv, preve;
  PrimalDual(int V) : graph(V), INF(numeric_limits<cost_t>::max()) {}
  void add_edge(int from, int to, flow_t cap, cost_t cost) {
    graph[from].emplace_back(
        (edge){to, cap, cost, (int)graph[to].size(), false});
    graph[to].emplace_back(
        (edge){from, 0, -cost, (int)graph[from].size() - 1, true});
  }
  cost_t min_cost_flow(int s, int t, flow_t f) {
    int V = (int)graph.size();
    cost_t ret = 0;
    using Pi = pair<cost_t, int>;
    priority_queue<Pi, vector<Pi>, greater<Pi>> que;
    potential.assign(V, 0);
    preve.assign(V, -1);
    prevv.assign(V, -1);
    while (f > 0) {
      min_cost.assign(V, INF);
      que.emplace(0, s);
      min_cost[s] = 0;
      while (!que.empty()) {
        Pi p = que.top();
        que.pop();
        if (min_cost[p.second] < p.first) continue;
        for (int i = 0; i < graph[p.second].size(); i++) {
          edge &e = graph[p.second][i];
          cost_t nextCost = min_cost[p.second] + e.cost + potential[p.second] -
                            potential[e.to];
          if (e.cap > 0 && min_cost[e.to] > nextCost) {
            min_cost[e.to] = nextCost;
            prevv[e.to] = p.second, preve[e.to] = i;
            que.emplace(min_cost[e.to], e.to);
          }
        }
      }
      if (min_cost[t] == INF) return -1;
      for (int v = 0; v < V; v++) potential[v] += min_cost[v];
      flow_t addflow = f;
      for (int v = t; v != s; v = prevv[v]) {
        addflow = min(addflow, graph[prevv[v]][preve[v]].cap);
      }
      f -= addflow;
      ret += addflow * potential[t];
      for (int v = t; v != s; v = prevv[v]) {
        edge &e = graph[prevv[v]][preve[v]];
        e.cap -= addflow;
        graph[v][e.rev].cap += addflow;
      }
    }
    return ret;
  }
  void output() {
    for (int i = 0; i < graph.size(); i++) {
      for (auto &e : graph[i]) {
        if (e.isrev) continue;
        auto &rev_e = graph[e.to][e.rev];
        cout << i << "->" << e.to << " (flow: " << rev_e.cap << "/"
             << rev_e.cap + e.cap << ")"
             << "\n";
      }
    }
  }
};
void init(int h, int w, vector<vector<long long>> &matrix) {
  matrix = vector<vector<long long>>(
      static_cast<unsigned long>(h),
      vector<long long>(static_cast<unsigned long>(w)));
}
vector<vector<long long>> &operator*(vector<vector<long long>> &matrix,
                                     vector<vector<long long>> &matrix1) {
  int height = static_cast<int>(matrix.size());
  int width = static_cast<int>(matrix[0].size());
  int height2 = static_cast<int>(matrix1.size());
  int width2 = static_cast<int>(matrix1[0].size());
  assert(width == height2);
  vector<vector<long long>> res;
  res = vector<vector<long long>>(static_cast<unsigned long>(height),
                                  vector<long long>(width2, 0));
  for (int i = 0; i < height; i++) {
    for (int j = 0; j < width2; j++) {
      for (int k = 0; k < width; k++) {
        res[i][j] =
            (((res[i][j]) % MOD) +
             (((((matrix[i][k]) % MOD) * ((matrix1[k][j]) % MOD)) % MOD) %
              MOD)) %
            MOD;
      }
    }
  }
  matrix.swap(res);
  return matrix;
}
vector<vector<long long>> Pow(vector<vector<long long>> matrix, long long x) {
  vector<vector<long long>> res = vector<vector<long long>>(
      matrix.size(), vector<long long>(matrix.size(), 0));
  for (int i = 0; i < (int)matrix.size(); i++) {
    res[i][i] = 1;
  }
  while (x) {
    if (x & 1) {
      res = res * matrix;
    }
    matrix = matrix * matrix;
    x >>= 1;
  }
  return res;
}
int n;
int a[100001];
set<int> set1;
map<int, int> map1;
int main() {
  cin >> n;
  for (auto i = (0); i < (n); ++i) cin >> a[i];
  for (auto i = (0); i < (n); ++i) set1.insert(a[i]), map1[a[i]]++;
  if (set1.size() == 1 && a[0] == 0) {
    cout << "Yes"
         << "\n";
    return 0;
  }
  if (set1.size() > 3 || n % 3 != 0) {
    cout << "No"
         << "\n";
    return 0;
  }
  if (set1.size() == 3) {
    int now = 0;
    for (auto ite = set1.begin(); ite != set1.end(); ite++) {
      now ^= *ite;
      if (map1[*ite] != n / 3) {
        cout << "No"
             << "\n";
        return 0;
      }
    }
    cout << "Yes"
         << "\n";
  } else if (set1.size() == 2) {
    int now = 0;
    for (auto ite = set1.begin(); ite != set1.end(); ite++) {
      now ^= *ite;
      if (map1[*ite] == n / 3 * 2)
        now ^= *ite;
      else if (map1[*ite] != n / 3) {
        cout << "No"
             << "\n";
        return 0;
      }
    }
    if (now == 0)
      cout << "Yes"
           << "\n";
    else
      cout << "No"
           << "\n";
  } else {
    int now = 0;
    for (auto ite = set1.begin(); ite != set1.end(); ite++) {
      now ^= *ite;
    }
    if (now != 0)
      cout << "No"
           << "\n";
    else
      cout << "No"
           << "\n";
  }
  return 0;
}
