#include <bits/stdc++.h>
using namespace std;
int c[25];
bool dp[2050][25][3] = {false};
int cnt1bit(int s) {
  int c = 0;
  while (s) c += s & 1, s >>= 1;
  return c;
}
int main() {
  int n;
  cin >> n;
  int leafCnt = 0;
  int it = 0;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    if (a == 1)
      leafCnt++;
    else
      c[it++] = a;
  }
  int restNode = n - leafCnt;
  if (restNode > 11) {
    puts("NO");
    return 0;
  }
  dp[0][1][0] = true;
  for (int i = 2; i <= leafCnt; i++) dp[0][i][1] = true;
  for (int S = 1; S < (1 << restNode); S++) {
    for (int k = 1; k <= leafCnt; k++)
      if (dp[S][k - 1][0] || dp[S][k - 1][1]) dp[S][k][1] = true;
    int ps = cnt1bit(S);
    for (int x = 0; x < restNode; x++) {
      if (!(S & (1 << x))) continue;
      int L = c[x] - ps;
      if (L >= 0 && L <= leafCnt && dp[S ^ (1 << x)][L][1]) dp[S][L][0] = true;
    }
    for (int S1 = 0; S1 <= S; S1++) {
      if (S1 & (~S)) continue;
      for (int k = 0; k <= leafCnt; k++) {
        for (int k1 = 0; k1 <= k; k1++) {
          if (dp[S1][k1][0] && (dp[S ^ S1][k - k1][0] || dp[S ^ S1][k - k1][1]))
            dp[S][k][1] = true;
        }
      }
    }
  }
  if (dp[(1 << restNode) - 1][leafCnt][0])
    puts("YES");
  else
    puts("NO");
  return 0;
}
