#include <bits/stdc++.h>
using namespace std;
const long double pi = 2 * acos(0.0);
template <class T>
bool umin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool umax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T, class TT>
bool pal(T a, TT n) {
  int k = 0;
  for (int i = 0; i <= n / 2; i++) {
    if (a[i] != a[n - i - 1]) {
      k = 1;
      break;
    }
  }
  return k ? 0 : 1;
}
int main() {
  int n;
  cin >> n;
  map<long long, long long> mp;
  long long sum = 0;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    sum += x;
    mp[x]++;
  }
  if (!sum) return cout << "Yes", 0;
  if (mp.size() == 3) {
    set<int> s;
    for (auto it : mp) s.insert(it.second);
    if (s.size() == 1) return cout << "Yes", 0;
  }
  cout << "No";
  getchar();
  getchar();
  return 0;
}
