#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
int n, out;
vector<int> in;
int dp[12][1 << 11];
bool check() {
  for (int i = 0; i < (int)n + 1; i++)
    for (int j = 0; j < (int)1 << n; j++) dp[i][j] = inf;
  for (int i = 0; i < (int)n; i++)
    if (in[i] >= 3) dp[1][1 << i] = in[i];
  for (int i = 0; i < (int)1 << n; i++) {
    for (int j = 0; j < (int)n; j++)
      for (int k = (i - 1) & i; k; k = (k - 1) & i) {
        if (dp[j][k] < inf && dp[1][i ^ k] < inf)
          dp[j + 1][i] = min(dp[j + 1][i], dp[j][k] + dp[1][i ^ k]);
      }
    for (int j = 0; j < (int)n; j++)
      if (!(i & 1 << j))
        for (int k = 0; k < (int)n; k++) {
          if (in[j] - 1 < dp[k][i]) continue;
          if (in[j] - 1 - dp[k][i] + k < 2) continue;
          dp[1][i | 1 << j] = in[j];
        }
  }
  return dp[1][(1 << n) - 1] < inf && in[n - 1] == n + out;
}
int main() {
  cin >> n;
  for (int i = 0; i < (int)n; i++) {
    int x;
    cin >> x;
    if (x == 1)
      out++;
    else
      in.push_back(x);
  }
  if (n == out || in.size() > 11) {
    cout << (n == 1 ? "YES" : "NO") << endl;
    return 0;
  }
  sort((in).begin(), (in).end());
  n = in.size();
  cout << (check() ? "YES" : "NO") << endl;
  return 0;
}
