#include <bits/stdc++.h>
using namespace std;
template <class T>
class depth_first_search_iterator {
 public:
  stack<pair<T, T>> todo;
  function<bool(T)> notvisited;
  function<void(T)> mark_visited;
  function<set<T>(T)> neighbors;
  depth_first_search_iterator() {}
  depth_first_search_iterator(T start, function<bool(T)> notv,
                              function<void(T)> mark_v,
                              function<set<T>(T)> neigh)
      : notvisited(notv),
        mark_visited(mark_v),
        neighbors(neigh),
        end_(false),
        current(start),
        prev(start) {
    todo.push(make_pair(start, start));
    operator++();
  }
  void operator++() {
    end_ = true;
    while (!todo.empty()) {
      current = todo.top().first;
      prev = todo.top().second;
      todo.pop();
      if (notvisited(current)) {
        mark_visited(current);
        for (const T x : neighbors(current)) {
          todo.push(make_pair(x, current));
        }
        end_ = false;
        break;
      }
    }
  }
  T operator*() { return current; }
  T previous() { return prev; }
  bool end() { return end_; }

 private:
  T current;
  T prev;
  bool end_;
};
template <class T>
class breadth_first_search_iterator {
 public:
  queue<pair<T, T>> todo;
  function<bool(T)> notvisited;
  function<void(T)> mark_visited;
  function<set<T>(T)> neighbors;
  breadth_first_search_iterator() {}
  breadth_first_search_iterator(T start, function<bool(T)> notv,
                                function<void(T)> mark_v,
                                function<set<T>(T)> neigh)
      : notvisited(notv),
        mark_visited(mark_v),
        neighbors(neigh),
        end_(false),
        current(start),
        prev(start) {
    todo.push(make_pair(start, start));
    operator++();
  }
  void operator++() {
    end_ = true;
    while (!todo.empty()) {
      current = todo.front().first;
      prev = todo.front().second;
      todo.pop();
      if (notvisited(current)) {
        mark_visited(current);
        for (const T x : neighbors(current)) {
          todo.push(make_pair(x, current));
        }
        end_ = false;
        break;
      }
    }
  }
  T operator*() { return current; }
  T previous() { return prev; }
  bool end() { return end_; }

 private:
  T current;
  T prev;
  bool end_;
};
template <class T>
class Graph {
 public:
  vector<T> vertices;
  vector<set<int>> neighbors;
  depth_first_search_iterator<int> dfs_iterator;
  breadth_first_search_iterator<int> bfs_iterator;
  vector<bool> visited;
  Graph() {}
  Graph(int n) {
    for (int i = 0; i < n; ++i) {
      AddVertex(0);
    }
  }
  void AddVertex(T val) {
    vertices.push_back(val);
    neighbors.push_back(set<int>());
  }
  bool EdgeExists(int i, int j) {
    return (neighbors[i].find(j) != neighbors[i].end());
  }
  void AddEdge(int i, int j) {
    if (!EdgeExists(i, j)) {
      neighbors[i].insert(j);
      if (i != j) {
        neighbors[j].insert(i);
      }
    }
  }
  T& operator[](int i) { return vertices[i]; }
  void RemoveEdge(int i, int j) {
    if (EdgeExists(i, j)) {
      neighbors[i].erase(find(neighbors[i].begin(), neighbors[i].end(), j));
      neighbors[j].erase(find(neighbors[j].begin(), neighbors[j].end(), i));
    }
  }
  void dfs_init(int start) {
    visited = vector<bool>(vertices.size(), false);
    dfs_iterator = depth_first_search_iterator<int>(
        start, [this](int x) { return !visited[x]; },
        [this](int x) { visited[x] = true; },
        [this](int x) { return neighbors[x]; });
  }
  void bfs_init(int start) {
    visited = vector<bool>(vertices.size(), false);
    bfs_iterator = breadth_first_search_iterator<int>(
        start, [this](int x) { return !visited[x]; },
        [this](int x) { visited[x] = true; },
        [this](int x) { return neighbors[x]; });
  }
  void print_() {
    for (int i = (0); i < (0) + (vertices.size()); ++i) {
      for (auto x : neighbors[i]) {
        if (i <= x) {
          cout << i << "-" << x << endl;
        }
      }
    }
  }
};
int main() {
  cout.precision(17);
  long long modd = 1000 * 1000 * 1000 + 7;
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  uniform_int_distribution<int> rand_gen(0, modd);
  long long infinit = 10000000000000000;
  int test_cases = 1;
  for (int t = (1); t < (1) + (test_cases); ++t) {
    int n;
    cin >> n;
    map<int, int> a;
    for (int i = (0); i < (0) + (n); ++i) {
      int kk;
      cin >> kk;
      a[kk]++;
    }
    if (a.size() > 3) {
      cout << "No" << endl;
      break;
    }
    if (a.size() == 3) {
      int a1 = a.begin()->first, a2 = next(a.begin())->first,
          a3 = next(a.begin(), 2)->first;
      int c1 = a.begin()->second, c2 = next(a.begin())->second,
          c3 = next(a.begin(), 2)->second;
      if ((c1 != c2) || (c2 != c3) || (c3 != c1)) {
        cout << "No" << endl;
        break;
      }
      if ((a1 ^ a2 == a3) || (a2 ^ a3 == a1) || (a3 ^ a1 == a2)) {
        cout << "Yes" << endl;
      } else {
        cout << "No" << endl;
      }
      break;
    }
    if (a.size() == 2) {
      int a1 = a.begin()->first, a2 = next(a.begin())->first;
      int c1 = a.begin()->second, c2 = next(a.begin())->second;
      if ((2 * c1 != c2) && (2 * c2 != c1)) {
        cout << "No" << endl;
        break;
      }
      if (2 * c1 == c2) {
        if (a1 == 0) {
          cout << "Yes" << endl;
        } else {
          cout << "No" << endl;
        }
      } else {
        if (a2 == 0) {
          cout << "Yes" << endl;
        } else {
          cout << "No" << endl;
        }
      }
    }
    if (a.size() == 1) {
      int a1 = a.begin()->first;
      if (a1 == 0) {
        cout << "Yes" << endl;
      } else {
        cout << "No" << endl;
      }
    }
  }
  return 0;
}
