#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> arr;
vector<long long> par;
vector<bool> hasParent;
long long memo[13][(1 << 14)][25] = {0};
long long solve(long long node, long long mask, long long leavesLeft) {
  if (arr[node] == 1) {
    if (leavesLeft == 0) {
      return 1;
    }
    return 2;
  }
  if (!hasParent[node]) return 2;
  if (memo[node][mask][leavesLeft]) {
    return memo[node][mask][leavesLeft];
  }
  for (long long sub = mask;; sub = (sub - 1) & mask) {
    long long bitCnt = 0;
    long long sumDegrees = 0;
    for (long long bit = 0; bit < n; ++bit) {
      if (sub & (1 << bit)) {
        bitCnt++;
        sumDegrees += arr[bit];
      }
    }
    if (sumDegrees < arr[node]) {
      for (long long bit = 0; bit < n; ++bit) {
        if (sub & (1 << bit)) {
          par[bit] = node;
          hasParent[bit] = true;
        }
      }
      long long remainingSpots = arr[node] - 1 - sumDegrees;
      long long children = bitCnt + remainingSpots;
      if (remainingSpots >= 0 && children >= 2 &&
          remainingSpots <= leavesLeft &&
          solve(node + 1, (mask ^ sub), leavesLeft - remainingSpots) == 1) {
        return memo[node][mask][leavesLeft] = 1;
      }
      for (long long bit = 0; bit < n; ++bit) {
        if (sub & (1 << bit)) {
          hasParent[bit] = false;
        }
      }
    }
    if (sub == 0) break;
  }
  return memo[node][mask][leavesLeft] = 2;
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  if (n == 1) {
    cout << "YES\n";
    return 0;
  }
  arr.resize(n);
  hasParent.resize(n, false);
  par.resize(n);
  hasParent[0] = true;
  long long leafCnt = 0;
  for (long long i = 0; i < n; ++i) {
    cin >> arr[i];
    if (arr[i] == 2) {
      cout << "NO\n";
      return 0;
    }
    leafCnt += (arr[i] == 1);
  }
  if (leafCnt < (n + 1) / 2) {
    cout << "NO\n";
    return 0;
  }
  sort(arr.rbegin(), arr.rend());
  if (arr[0] != n) {
    cout << "NO\n";
    return 0;
  }
  n -= leafCnt;
  long long mask = (1 << n) - 2;
  if (solve(0, mask, leafCnt) == 1) {
    cout << "YES\n";
  } else {
    cout << "NO\n";
  }
  return 0;
}
