#include <bits/stdc++.h>
using namespace std;
int n, nleaves, p, need, sated;
vector<int> nodes;
bool valid[4096];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> p;
    if (p == 1)
      nleaves++;
    else
      nodes.push_back(p), need += p - 1;
  }
  sort(nodes.begin(), nodes.end());
  for (int i = 0; i + 1 < nodes.size(); i++) sated += nodes[i];
  if (n == 1 && nleaves == 1) {
    cout << "YES\n";
    return 0;
  }
  if (need - sated != nleaves || nodes.size() == 0 || nodes[0] == 2 ||
      nleaves < nodes.size()) {
    cout << "NO\n";
    return 0;
  }
  valid[0] = true;
  for (int cur = 0; cur < nodes.size(); cur++) {
    for (int base = (1 << cur) - 1; base >= 0; base--)
      for (int i = 0; i <= base; i++) {
        if ((i & base) != i) continue;
        int csum = 0, nch = 0;
        for (int j = 0; j < cur; j++)
          if ((i & (1 << j)) != 0) csum += nodes[j], nch++;
        if (csum <= nodes[cur] - 1 && (nodes[cur] - 1) - csum + nch > 1)
          if (valid[base - i] == true) valid[base] = true;
      }
  }
  if (valid[(1 << (nodes.size() - 1)) - 1])
    cout << "YES\n";
  else
    cout << "NO\n";
  return 0;
}
