#include <bits/stdc++.h>
using namespace std;
int a[30];
int sum[10005];
int ones[10005], Log[10005];
bool dp[10005][30];
int main() {
  int n, m = 0, l = 0;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    if (t == 1)
      l++;
    else
      a[m++] = t;
  }
  if (l < n / 2) {
    cout << "NO\n";
    return 0;
  }
  if (n == 1) {
    if (l == 1)
      cout << "YES\n";
    else
      cout << "NO\n";
    return 0;
  }
  sort(a, a + m);
  for (int i = 0; i < (1 << m); i++) {
    int s = 0;
    for (int j = 0; j < m; j++)
      if ((1 << j) & i) {
        s += a[j];
        ones[i]++;
        Log[i] = j;
      }
    sum[i] = s;
  }
  dp[0][l] = true;
  for (int i = 1; i < (1 << m); i++) {
    for (int j = 0; j <= l; j++) {
      int b = (1 << Log[i]);
      for (int k = 0; k < b; k++)
        if ((k & i) == 0 && sum[b] >= sum[k] + 1 &&
            ones[k] + (sum[b] - 1 - sum[k]) > 1)
          dp[i][j] |= dp[i + k - b][j + sum[b] - sum[k] - 1];
    }
    dp[0][l] = false;
  }
  if (dp[(1 << (m - 1))][0])
    cout << "YES\n";
  else
    cout << "NO\n";
  return 0;
}
