#include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
const int dx_8[] = {1, 1, 0, -1, -1, -1, 0, 1},
          dy_8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const long long MOD = 1e9 + 7;
template <typename T>
inline T GCD(T a, T b) {
  T c;
  while (b != 0) {
    c = a % b;
    a = b;
    b = c;
  }
  return a;
}
template <typename T>
inline T LCM(T a, T b) {
  T c = GCD(a, b);
  a /= c;
  return a * b;
}
template <typename T>
inline T nCr(T a, T b) {
  T i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= (a + 1 - i);
    r /= i;
  }
  return r;
}
template <typename T>
inline T nHr(T a, T b) {
  return nCr(a + b - 1, b);
}
signed main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long N, A[100000];
  cin >> N;
  map<long long, long long> mp;
  for (long long i = 0; i < (N); ++i) {
    cin >> A[i];
    mp[A[i]]++;
  }
  long long cnt = 0;
  vector<long long> vec;
  for (auto i : mp) {
    cnt++;
    vec.emplace_back(i.second);
  }
  if (cnt != 3)
    cout << "No" << '\n';
  else {
    long long a = N / 3;
    long long check = 0;
    for (long long i = 0; i < (3); ++i) {
      check = check xor vec[i];
      if (!(vec[i] == a or vec[i] == a + 1)) {
        cout << "No" << '\n';
        return 0;
      }
    }
    if (check != 0)
      cout << "No" << '\n';
    else
      cout << "Yes" << '\n';
  }
}
