#include <bits/stdc++.h>
using namespace std;
int n, p[24], w[24];
inline bool solve(int d) {
  if (d == n) return *max_element(p, p + n) == 0;
  int used = 0;
  for (int i = 0; i < (d); ++i) {
    if ((p[i] > w[d] || p[i] == w[d] && p[i] + 1 != w[i]) &&
        ((used >> p[i]) & 1) == 0) {
      p[i] -= w[d];
      if (solve(d + 1)) return true;
      p[i] += w[d];
      used |= 1 << p[i];
    }
  }
  return false;
}
int main() {
  cin >> n;
  for (int i = 0; i < (n); ++i) cin >> w[i];
  sort(w, w + n, greater<int>());
  for (int i = 0; i < (n); ++i) p[i] = w[i] - 1;
  cout << (solve(1) ? "YES" : "NO") << endl;
  return 0;
}
